#include<bits/stdc++.h>
    using namespace std;
    const int N=1e8+5;
    int n,mx=1,mi=1;
    int mos[N]={0},rep[N]={0};;
    int main()
    {
    	freopen("duela9.in","r",stdin);
    	freopen("duela9.out","w",stdout);
		cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>mos[i];
    	}
    	sort(mos,mos+n+1);
    	while(mos[1]!=mos[n]){
			for(int i=1;i<=n;i++){ //取最小有多少个
				if(mos[i]==mos[i+1])
				mi++;
				else break;
    		} 
    		for(int i=n;i>=1;i--){ //取最大有多少个
				if(mos[i-1]==mos[i])
				mx++;
				else break;
    		}
			for(int i=mx+1,a=1;i<=n-mx;i++){
				rep[a++]=mos[i];
			}
			mos[N]=rep[N];
			memset(rep,0,sizeof(rep));
			n=n-2*mx;
		
		}
    	cout<<n<<endl;
    }