codeforces 水题 37A-Towers

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

Copy

3
1 2 3

output

1 3

input

Copy

4
6 5 6 7

output

2 3

     简单的sort排序加记录数组，由于木棒的长度最长不超过1000，因此我们可以多设置一个数组b来记录各长度木棒的个数

     放代码：

#include<bits/stdc++.h>
using namespace std;
int a[10005];
int b[10005];
int main()
{
	int n;
	cin>>n;
	memset(b,0,sizeof(b));
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	 } 
	 sort(a,a+n);
	 for(int i=0;i<n;i++)
	 {
	 		b[a[i]]++;
	 }
	 sort(b,b+10000);
	 int c=0;
	 for(int i=0;i<10000;i++)
	 {
	 	if(b[i]) c++;
	 }
	 printf("%d %d\n",b[9999],c);
	 return 0;
}