#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
const int B=1024,T=200000;
auto solve(){
    int n,x=0;
    cin>>n;
    vector<int> a(n);
    for(auto &v:a) cin>>v;
    ll ans=0;
    for(int i=0;i<__lg(n);i++){
        vector<int> num(1<<(__lg(n)-i-1));
        vector<int> fnum(1<<(__lg(n)-i-1));
        ll rev=0,frev=0;
        for(int j=0;j<n;j++){
            if((a[j]>>i)&1){
                num[a[j]>>(i+1)]++;
                frev+=fnum[a[j]>>(i+1)];
            }
            else{
                rev+=num[a[j]>>(i+1)];
                fnum[a[j]>>(i+1)]++;
            }
        }
        if(frev<rev) x^=1<<i; 
        // printf("# %d %lld %lld\n",i,rev,frev);
        ans+=min(rev,frev);
    }
    if(x) ans++;
    // cout<<x<<endl;
    return ans;
}   
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        // solve();
        cout<<solve()<<'\n';
        // cout<<(solve()?"Yes":"No")<<'\n';
    }
    return 0;
}