d={}
a=int(input())
l=list(map(int,input().split()))
x=0
for i in l:
if i not in d:
d[i]=1
else:
d[i]+=1
if d[i]>x:
x=d[i]
print(x)#include <bits/stdc++.h>
using namespace std;
int ans; map <int, int> mp;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n; i++) {
int a; cin >> a;
mp[a]++;
}
for (auto i = mp.begin(); i != mp.end() ; i++) {
ans = max(i->second, ans);
}
cout << ans;
}107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |