#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n,r[N];
queue<int> q;
bool cmp(int x,int y){
	return x<y; 
}
int ans;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>r[i];
	}
	sort(r+1,r+1+n,cmp);
	q.push(r[1]);
	for(int i=1;i<=n;i++){
		if(i==1) continue;
		if(r[i]==q.front()) q.push(r[i]);
		if(r[i]>q.front()){
			q.pop();
			q.push(r[i]);
		} 
	
	} 	 
	ans=q.size();
	cout<<ans; 
	
}