/*input
8
7 2 4 5 3 1 6 0
*/

#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

int n, lgn;
array<int, (1 << 18) + 1> arr;

long long countInversions(int l, int r) {
	if (l >= r) return 0ll;
	int mid = (l + r) >> 1;
	long long res = countInversions(l, mid) + countInversions(mid + 1, r);
	vector<int> merged; merged.reserve(r - l + 1);
	for (int i = l, j = mid + 1; i <= mid || j <= r;) {
		if (i > mid) {
			merged.push_back(arr[j++]);
		} else if (j > r) {
			merged.push_back(arr[i++]);
		} else if (arr[i] <= arr[j]) {
			merged.push_back(arr[i++]);
		} else {
			res += mid + 1 - i;
			merged.push_back(arr[j++]);
		}
	}
	move(merged.begin(), merged.end(), arr.begin() + l);
	return res;
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) cin >> arr[i];
	lgn = round(log2(n));
	vector<array<int, 2>> cnt(lgn, array<int, 2>{});
	vector<array<long long, 2>> inv(lgn, array<long long, 2>{});

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < lgn; j++) {
			int jbit = arr[i] >> j & 1;
			cnt[j][jbit]++;
			inv[j][jbit] += cnt[j][jbit ^ 1];
		}
	}
	int x = 0;
	for (int j = 0; j < lgn; j++) {
		x |= (inv[j][0] > inv[j][1]) << j;
	}

	for (int i = 0; i < n; i++) arr[i] ^= x;
	cout << countInversions(0, n - 1) + (x != 0) << endl;
}