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

#define F first
#define S second
#define ar array
typedef int uci;
#define int long long
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ll long long
typedef pair<int, int> pii;
typedef vector<int> vi;

int n;
int count(int v, vector<int> &bit){
    v++;
    int out{};
    while(v >= 1){
        out += bit[v-1];
        v ^= v&(-v);
    }
    return out;
}

void add(int v, vector<int> &bit){
    v++;
    while(v <= n){
        bit[v-1]++;
        v += v&(-v);
    }
}

void solve(){
    cin >> n;
    vector<int> a(n);
    for(int i{}; i < n; ++i)
        cin >> a[i];

    int c{};
    int t = n;
    while(t){
        t >>= 1;
        c++;
    }
    c--;


    int out{};
    int mask{};
    for(int i = c; i >= 1; --i){
        int totinv{};
        int maxinv{};
        for(int j{}; j < n; j += (1<<i)){
            maxinv += (1<<i)*((1<<i)-1)/2;
            int ones{};
            for(int k = j; k < j+(1<<i); ++k){
                if(a[k]&(1<<(i-1)))
                    ones++;
                else{
                    totinv += ones;
                }
            }
        }
        maxinv -= totinv;
        if(totinv >= maxinv+1){
            for(int j{}; j < n; ++j){
                a[j] ^= (1<<(i-1));
            }
            out++;
        }
        mask |= (1<<(i-1));
        stable_sort(a.begin(), a.end(), [=](auto b, auto c){
            return (b&mask) < (c&mask);
                });
        out += min(maxinv, totinv);
    }

    cout << out << '\n';
}

uci main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
}