CF37A.Towers

Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

小瓦西亚收到了一套儿童建筑玩具。该玩具由若干根木条组成，所有木条的长度均已知。当且仅当两根木条长度相同时，才能将其中一根叠放在另一根之上。

瓦西亚希望用这些木条搭建尽可能少的塔。请帮助瓦西亚以最优方式使用这些木条。

The first line contains an integer N (1 ≤ N ≤ 1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers l__i — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

第一行包含一个整数 $N$（$1 \leq N \leq 1000$）—— 表示瓦夏可使用的木条数量。
第二行包含 $N$ 个以空格分隔的整数 $l_i$ —— 表示各木条的长度。所有长度均为不超过 $1000$ 的正整数。

In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.

在一行中输出两个数——最高塔的高度以及具有该高度的塔的总数。注意，瓦西娅必须使用所有的木条。