n=int(input())
l=[int(x) for x in input().split()]
d={}
for i in range(n):
d[i]=l.count(l[i])
print(max(d.values()),len(set(l)))#include <bits/stdc++.h>
using namespace std ;
const int AKA =5e5+5;
int fr[AKA];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;++i)
{
int value;
scanf("%d",&value);
++fr[value];
}
int sum=0 , mx=1;
for(int i=0;i<=1000;++i){
if(fr[i])
++sum;
if(fr[i]>mx)
mx=fr[i];
}
printf("%d %d",mx,sum);
}
1363A - Odd Selection | 131B - Opposites Attract |
490C - Hacking Cypher | 158B - Taxi |
41C - Email address | 1373D - Maximum Sum on Even Positions |
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |