#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 5005;
#define lson l, mid, root<<1
#define rson mid+1, r, root<<1|1
int sum[N<<2], a[N];

void Push_Up(int root)
{
    sum[root] = sum[root<<1] + sum[root<<1|1];
}
void build_tree(int l, int r, int root)
{
    sum[root] = 0;
    if(l == r) return;
    int mid = (l + r) >> 1;
    build_tree(lson);
    build_tree(rson);
}
void update(int p, int l, int r, int root)
{
    if(l == r)
    {
        sum[root]++;
        return;
    }
    int mid = (l + r) >> 1;
    if(p <= mid) update(p, lson);
    else update(p, rson);
    Push_Up(root);
}
int Query(int L, int R, int l, int r, int root)
{
    if(L <= l && r <= R)
    {
        return sum[root];
    }
    int mid = (l + r) >> 1;
    int ans = 0;
    if(L <= mid) ans += Query(L, R, lson);
    if(R > mid) ans += Query(L, R, rson);
    return ans;
}

int main()
{
    int n, i;
    while(~scanf("%d",&n))
    {
        build_tree(0, n-1, 1);
        int res = 0;
        for(i = 0; i < n; i++)
        {
            scanf("%d",&a[i]);
            res += Query(a[i], n-1, 0, n-1, 1); //查询已经插入到线段树中的数有多少个数比a[i]大
            update(a[i], 0, n-1, 1); //把这个数插入到线段树中
        }
        int ans = res;
        for(i = 0; i < n; i++)
        {
            res += (n - a[i] - 1) - a[i];
            ans = min(ans, res);
        }
        printf("%d\n", ans);

    }
    return 0;
}