CF37A.Towers

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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$ .

输出格式

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

输入输出样例

输入#1
```
3
1 2 3
```
输出#1
```
1 3
```
输入#2
```
4
6 5 6 7
```
输出#2
```
2 3
```

首页