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

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
using vvi = vector<vi>;

#define rep(i, a, b) for(int i = a; i < (b); i++)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

struct FT {
    vector<ll> s;
    FT(int n): s(n) {}
    void update(int pos, ll dif) {
        for (; pos < sz(s); pos |= pos+1) s[pos] += dif;
    }
    ll query(int pos) {
        ll res = 0;
        for (; pos > 0; pos &= pos-1) res += s[pos-1];
        return res;
    }
};

ll count_invs(const vector<int>& arr) {
    FT tree(sz(arr));
    ll res = 0;
    for (int i = sz(arr)-1; i >= 0; i--) {
        res += tree.query(arr[i]);
        tree.update(arr[i], 1);
    }
    return res;
}

void solve() {
    int n;
    cin >> n;

    vi arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    ll res = count_invs(arr);
    ll res2 = 1;
    for (int bit = __lg(n); bit > 0; bit--) {
        vector<int> num1s(n>>bit);
        vector<int> tot(n>>bit);
        ll tot_pairs = 0, invs = 0;
        for (int i = 0; i < n; i++) {
            int idx = arr[i]>>bit;
            int val = (arr[i]>>(bit-1))&1;
            tot_pairs += tot[idx];
            tot[idx]++;
            if (val == 0) invs += num1s[idx];
            num1s[idx] += val;
        }
        res2 += min(invs, tot_pairs-invs);
    }
    cout << min(res, res2) << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    solve();

    return 0;
}