5836: Towers

内存限制:256 MB 时间限制:2 S
题面:传统 评测方式:文本比较 上传者:
提交:1 通过:1

题目描述

A. Towers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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 li − the lengths of the bars. All the lengths are natural numbers not exceeding 1000.
Output
In one line output two numbers − the height of the largest tower and their total number. Remember that Vasya should use all the bars.
Examples
Input
3
1 2 3
Output
1 3
Input
4
6 5 6 7
Output
2 3

输入样例 复制


输出样例 复制


分类标签