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

#define forn(i,n) for (int i=0; i<(n); i++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;

template<typename A, typename B> ostream& operator<<(ostream & cout, pair<A,B> const &p) {
    return cout << "("<< p.f << ", "<< p.s << ")";
}
template<typename A> ostream& operator<<(ostream &cout, vector<A> const & v) {
    cout << "[";
    forn(i, v.size()) {
        if(i) cout << ", ";
        cout << v[i];
    }
    return cout << "]";
}

ll inv(vector<int>& v) {
    int n = v.size();
    ll ans = 0, oc = 0;
    forn(i, n) {
        if(v[i] == 1) oc++;
        else ans += oc;
    }
    return ans;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n; cin >> n;
    vector<int> v(n);
    forn(i, n) {
        cin >> v[i];
    }
    int LG = 0; // # of bits
    int nc = n;
    while(nc > 0) {
        LG++;
        nc /= 2;
    }

    vector<map<int, vector<int>>> r(LG+1);
    forn(i, n) {
        for(int j=1; j<=LG; j++) {
            r[j][v[i] >> j].pb((v[i]>>(j-1))&1);
        }
    }
    ll inv_with_move=0, inv_without_move=0;
    for(int i=1; i<=LG; i++) {
        ll wm = 0;
        ll R = -1;
        for(auto p: r[i]) {
            R = p.s.size();
            ll x = inv(p.s);
            // cout << p.s << " " << x << "\n";
            wm += x;
        }
        inv_without_move += wm;
        inv_with_move += min(wm, n*(R-1)/2 - wm);
    }

    cout << min(inv_with_move+1, inv_without_move) << "\n";


   
}