#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 18;

int a[1 << N], b[1 << N], pos[1 << N], f[1 << N | 5];
int n;

void add(int x, int y) {
    ++x;
    while (x <= n) {
        f[x] += y;
        x += (x & -x);
    }
}

int query(int x) {
    ++x;
    int ans = 0;
    while (x) {
        ans += f[x];
        x &= (x - 1);
    }
    return ans;
}

ll cnt[N], all[N];
void solve(int l, int r, int dep) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    solve(l, mid, dep + 1); solve(mid + 1, r, dep + 1);
    all[dep] += 1ll * (mid - l + 1) * (r - mid);
    int p1 = l, p2 = mid + 1, p3 = l;
    while (p1 <= mid || p2 <= r) {
        if (p1 <= mid && (p2 > r || a[p1] < a[p2])) {
            b[p3] = a[p1]; ++p1; ++p3;
        } else {
            b[p3] = a[p2]; ++p2; ++p3; cnt[dep] += p1 - l;
        }
    }
    for (int i = l; i <= r; i++) a[i] = b[i];
}

int main() {
    read(n);
    for (int i = 0; i < n; i++) read(a[i]), pos[a[i]] = i;
    ll ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        ans += query(a[i]);
        add(a[i], 1);
    }
    solve(0, n - 1, 0);
    ll sum = 1;
    for (int i = 0; i < N; i++) {
        sum += min(cnt[i], all[i] - cnt[i]);
    }
    ans = min(ans, sum);
    print(ans, '\n');
    return 0;
}