#include<bits/stdc++.h>
using namespace std;
int n,a[100005],cnt,s[100005],f[100005];
int main(){
	freopen("a.in","r",stdin);
	scanf("%d",&n);
	for(int i = 1; i <= n; i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+1+n);
	for(int i = 1; i <= n; i++){			
		f[a[i]]++;
		if(a[i] != a[i-1]){
			cnt++;	
		
			s[cnt] = a[i];
		}
	}
	for(int i = 1; i <= cnt; i++){
		if(f[s[i]] >= f[s[i-1]]){
			n -= f[s[i-1]];
			f[s[i-1]] = 0;
			
		}else{
			n -= f[s[i]];
			f[s[i-1]] -= f[s[i]];
			f[s[i]] += f[s[i-1]];
		}
	}
	cout << n;
	return 0; 
}