题解

#include<cstdio>
#include<algorithm>
using namespace std;
int n,bucket[100000],ans=0;
int main(){
scanf("%d",&n);
int tmp;
for(int i=0;i<n;i++){
scanf("%d",&tmp);
bucket[tmp]++;
ans=max(ans,bucket[tmp]);
}
printf("%d",ans);
return 0;
}