n = int(input())
s = sorted([*map(int,input().split())])
m = -10**10
cnt = 1
for i in range(n-1):
if(s[i] == s[i+1]): cnt += 1
else: m = max(m,cnt); cnt = 1
m = max(cnt,m)
print(m)#include<bits/stdc++.h>
using namespace std;
int main()
{
int ar[1005]= {0};
int n;
cin>>n;
for(int i=0; i<n; i++)
{ int x;
cin>>x;
ar[x]++;
}
sort(ar,ar+1005,greater<int>());
cout<<ar[0]<<endl;
return 0;
}
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |