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

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a) {
  for (auto x : a) cerr << x << ' ';
  cout << endl;
}

void print(auto x) { cout << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

struct BIT {
  ll n;
  vector<ll> data;
  
  BIT() = default;
  BIT(ll n) : n(n), data(n + 1, 0) { }
  
  // a_x += val;
  void add(ll x, ll val) {
    x++;
    for ( ; x <= n; x += x & -x) data[x] += val;
    return;
  }
  
  // sum of a[0, x)
  ll sum(ll x) {
    ll ret = 0;
    for ( ; x > 0; x -= x & -x) ret += data[x];
    return ret;
  }
  
  // sum of a[lx, rx)
  ll sum(ll lx, ll rx) {
    return sum(rx) - sum(lx);
  }  
};

int main() {
  int n;
  cin>>n;
  vi a(n);
  rep(i,n)cin>>a[i];
  ll inv=0;
  BIT bit(n);
  rep(i,n){
    inv+=bit.sum(a[i],n);
    bit.add(a[i],1);
  }
  ll ans2=inv+1;
  for(int i=1;i<n;i*=2){
    ll now=0,nxt=0,c0=0,c1=0;
    rep(j,n){
      if((a[j]&i)==0){
        now+=c1;
        c0++;
      }
      else{
        nxt+=c0;
        c1++;
      }
    }
    if(now>nxt){
      ans2+=-now+nxt;
    }
  }
  cout<<min(inv,ans2)<<endl;
}