WA on 2,3,4,7,9,16,17,18,19,20

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
ll n,a[N],ne[N],ct=0;
bool us[N],g[N];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1);
	for(int i=1,j=2;i<=n;i++){
		while(j<=n&&a[i]>=a[j]) j++;
		ne[i]=j;
	}
	//for(int i=1;i<=n;i++) cout<<ne[i]<<endl;
	ll j=ne[1];
	for(int i=1;i<=n&&j<=n;i++){
		for(j=max(ne[i],j);j<=n;j++){
			if(!us[j]&&!g[j]){
				us[i]=1;
				g[j]=1;
				ct++;
			}
		}
	}
	cout<<n-ct<<endl;
	return 0;
}