#include <bits/stdc++.h>
using namespace std;

const int N = 1e7+10;

int a[N],n,sum[N],b[N],rr;

int main(){
	freopen("duela.in","r",stdin);
	freopen("duela.out","w",stdout); 
	scanf("%d",&n);
	int mx=0;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+1+n);
	int tot=0;
	for(int i=1;i<=n;i++){
		if(a[i]!=a[i-1]){
			tot++;
		}
		b[tot]++;
	}
//	for(int i=1;i<=tot;i++)cout<<b[i]<<" ";
//	cout<<endl;
	int cnt=0;
//	rr=b[1];
//	cout<<"  ";
	for(int i=2;i<=tot;i++){
		int q=0,s=min(b[i],b[i-1]);
		b[i]-=s;
		b[i-1]-=s;
		if(b[i]){
			q=min(sum[i-1],b[i]/2);
		}
		b[i]=b[i]+b[i-1]-2*q;
		sum[i]=s+q+sum[i-1];
//		cout<<b[i]<<" ";
	}
//	cout<<endl;
	printf("%d",b[tot]);
	return 0;
}