#include<iostream>
using namespace std;

#define int long long 
#define pb push_back
#define F first 
#define S second
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#define N 400005
int a[N], bit[N];
void add(int x, int val){
    while(x < N)
        bit[x] += val, x += x & -x;
}
int query(int l, int r){
    int ret = 0;
    l--;
    while(l)
        ret -= bit[l], l -= l & -l;
    while(r)
        ret += bit[r], r -= r & -r;
    return ret;
}

void solve(){
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    if(n == 1){
        cout << "0\n";
        return;
    }
    if(n == 2){
        if(a[1] == 0)
            cout << "0\n";
        else
            cout << "1\n";
        return;
    }
    int x = 0;
    int ans = 0;
    for (int b = 0; b < 20; b++){
        int cnt = 0;
        for (int i = 0; i < n; i++){
            if((i >> b) & 1)
                continue;
            cnt += (a[i + 1] >> b) & 1;
        }
        if(cnt > n / 4)
            x |= (1 << b), ans++;
        // cout << b << " " << cnt << "\n";
    }
    // cout << x << "\n";
    for (int i = 1; i <= n; i++)
        a[i] ^= x, a[i]++;
    // cout << "\n";
    for (int i = 1; i <= n; i++){
        ans += query(a[i] + 1, N - 1);
        add(a[i], 1);
    }
    cout << ans << "\n";
}


signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}