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

#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const int N = (1<<18);

int n, a[N];
int sz = 1;
int go[2][N * 3];
long long ans[2][N * 3];
vector<int> t[N];

void add(int x, int pos) {
    int v = 1;
    for (int i = 18; i >= 0; --i) {
        int b = (x >> i) & 1;
        if (go[b][v] == 0) go[b][v] = ++sz;
        v = go[b][v];
        t[v].push_back(pos);
    }
}

long long calc(vector<int> &v, vector<int> &u) {
    long long ret = 0;
    for (int i = 0, j = 0; i < v.size(); ++i) {
        while (j < u.size() && u[j] < v[i]) {
            j++;
        }
        ret += j;
    }
    return ret;
    if (v.size() && u.size()) {
        for (auto x : v) cout << x << " ";
        cout << '\n';
        for (auto x : u) cout << x << " ";
        cout << '\n';
        cout << ret << '\n';
        cout << "________\n";
    }
}

void dfs(int v = 1, int bit = 18) {
    if (bit == -1) return;
    long long x = calc(t[go[0][v]], t[go[1][v]]);
    ans[0][bit] += x;
    ans[1][bit] += sz(t[go[0][v]]) * sz(t[go[1][v]]) - x;
    dfs(go[0][v], bit-1);
    dfs(go[1][v], bit-1);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        add(a[i], i);
    }
    dfs();
    long long Ans[2] = {};
    for (int i = 0; i <= 18; ++i)  {
        Ans[0] += ans[0][i];
        Ans[1] += min(ans[0][i], ans[1][i]);
    }
    cout << min(Ans[0], Ans[1] + 1) << '\n';
}