// 長い夜の終わりを信じながら
// Think twice, code once.
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, a[1 << 18], ans1, ans2;

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", &a[i]);
	for (int i = __lg(n) - 1; i >= 0; i--) {
		int len = 1 << (i + 1);
		int res0 = 0, res1 = 0;
		for (int j = 0; j < n; j += len) {
			vector<int> vec[2];
			for (int k = j; k < j + len; k++) {
				if (!(a[k] >> i & 1)) res0 += vec[1].size();
				else res1 += vec[0].size();
				vec[a[k] >> i & 1].push_back(a[k]);
			}
			for (int k = 0; k < len / 2; k++) a[j + k] = vec[0][k];
			for (int k = 0; k < len / 2; k++) a[j + len / 2 + k] = vec[1][k];
		}
		ans1 += res0, ans2 += min(res0, res1);
	}
	printf("%d\n", min(ans1, ans2 + 1));
	return 0;
}