#include <bits/stdc++.h>

using namespace std;

using LL = long long;

int n;

LL solve(vector<vector<int>>& a, bool rev, int dep) {
  if (dep == -1) {
    return 0;
  }
  vector<vector<int>> next_a;
  LL ret = 0;
  for (auto& seg : a) {
    vector<int> v1, v0;
    LL cnt = 0;
    for (auto& v : seg) {
      if (v & (1 << dep)) {
        v1.push_back(v);
        cnt++;
      } else {
        v0.push_back(v);
        ret += cnt;
      }
    }
    next_a.push_back(v0);
    next_a.push_back(v1);
  }
  LL total_pair = 1LL * n * (a[0].size() - 1) / 2;
  if (rev) {
    ret = min(ret, total_pair - ret);
  }
  ret += solve(next_a, rev, dep - 1);
  return ret;
}

int main() {
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int p = 0;
  while ((1 << p) < n) {
    p++;
  }
  vector<vector<int>> b;
  b.push_back(a);
  LL ans = solve(b, true, p - 1) + 1;
  ans = min(ans, solve(b, false, p - 1));
  printf("%lld\n", ans);
}