You have a collection of n trading cards, each stamped with a numeric identifier. You want to bind cards together into pairs, but a pair may only be formed from two cards that share the same identifier, and each card may be used in at most one pair.

Form as many such pairs as possible from the collection. Any cards that cannot be paired off are left as singles.

Given the identifiers of all n cards, report the maximum number of pairs that can be formed and the number of cards left unpaired after forming them.

Input format

Line 1: a single integer n, the number of cards. Line 2: n space-separated integers id_1 ... id_n, the identifier stamped on each card.

Output format

Print two space-separated integers on one line: the number of pairs formed, followed by the number of cards left unpaired.

Constraints

• 1 <= n <= 100
• 1 <= id_i <= 1000

7
1 3 2 1 3 2 2

3 1

2
1 1

1 0