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

#define int long long

int inversions(vector<int> a) {
    int inversion = 0;
    function<void(int, int)> mergesort = [&](int l, int r) {
        if (r - l <= 1) return;
        int m = l + (r - l) / 2;
        mergesort(l, m);
        mergesort(m, r);
        vector<int> merged;
        int i = l, j = m;
        while (i < m && j < r) {
            if (a[i] <= a[j]) {
                merged.push_back(a[i++]);
            } else {
                inversion += m - i;
                merged.push_back(a[j++]);
            }
        }
        while (i < m) merged.push_back(a[i++]);
        while (j < r) merged.push_back(a[j++]);
        for (auto x : merged) a[l++] = x;
    };
    mergesort(0, a.size());
    return inversion;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    int bits = log2(n);

    auto curr = a;
    int xorval = 0;
    for(int bit = bits - 1; bit >= 0; --bit) {
        int mask = 1 << bit;
        vector<int> ones; 
        vector<int> zeros;
        int icnt = 0;
        int n_ones = 0;
        for (int i = 0; i < n; ++i) {
            int x = curr[i];
            if (i % (1 << (bit + 1)) == 0) n_ones = 0;
            if (mask & x) {
                ones.push_back(x & ~mask);
                ++n_ones;
            } else {
                zeros.push_back(x & ~mask);
                icnt += n_ones;
            }
        }
        xorval <<= 1;
        if (icnt > (1 << bit)) {
            xorval |= 1;
        }
        curr = zeros;
        curr.insert(end(curr), begin(ones), end(ones));
    }

    int res = inversions(a);
    for (auto& x : a) x ^= xorval;
    res = min(res, inversions(a) + 1);
    cout << res << endl;
}