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

bool x = 0;

pair<int,int> solve(vector<int>::iterator it, int shift, int size) {
	int zero = 0, one = 0;
	for (int i = 0, seen1 = 0, seen0 = 0; i < size; i++) {
		if ((*(it+i)) & (1 << shift)) one += i - seen1++;
		else zero += i - seen0++;
	}
	return {zero, one};
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n; cin >> n;
	vector<int> a(n); for (int &x : a) cin >> x;

	long long ans = 0;
	for (int shift = log2(n)-1, size = n; shift >= 0; shift--, size /= 2) {
		pair<long long,long long> p {0,0};
		for (int i = 0; i < n; i += size) {
			auto t = solve(a.begin()+i, shift, size);
			p.first += t.first, p.second += t.second;
		}

		ans += min(p.first, p.second);
		if (p.second < p.first) {
			x = 1;
			for (int i = 0; i < n; i += size) {
				stable_sort(a.begin()+i, a.begin()+i+size, [&](int a, int b) {
					return (a & (1 << shift)) > (b & (1 << shift));
				});
			}
		} else {
			for (int i = 0; i < n; i += size) {
				stable_sort(a.begin()+i, a.begin()+i+size, [&](int a, int b) {
					return (a & (1 << shift)) < (b & (1 << shift));
				});
			}
		}
	}

	cout << ans+x << '\n';
}