#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+5;
int n;
int r[MAXN];
bool check(int x,int i){
    if(r[x]>r[i])return true;
    else return false;
}
bool vis[MAXN];
int cnt,k=1;
int main(){
    freopen("duela.in","r",stdin);
    freopen("duela.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>r[i];
    sort(r+1,r+n+1);
    for(int i=1;i<=n;i++){
        if(vis[i])continue;
        int l=k+1;
        int r=n;
        while(l<r){
            int mid=(l+r)/2;
            if(check(mid,i))r=mid;
            else l=mid+1;
        }
        if(check(l,i)){
            vis[i]=true;
            vis[l]=true;
            cnt+=2;
        }
        k=l;
    }
    cout<<n-cnt<<endl;
    return 0;
}