#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 using namespace std;

 typedef long long LL;

 const int INF = (<<)-;

 const int mod=;

 const int maxn=;

 int n;

 int a[maxn],c[maxn];

 int lowbit(int x){ return x &(-x);}

 int sum(int x){

     int ret =;

     while(x>){

         ret+=c[x];x-=lowbit(x);

     }

     return ret;

 }

 void add(int x,int d){

     while(x<=n){

         c[x]+=d;x+=lowbit(x);

     }

 }

 int main(){

     while(scanf("%d",&n) != EOF){

         memset(c,,sizeof(c));

         for(int i=;i<=n;i++) scanf("%d",&a[i]),a[i]++;

         int ans=;

         for(int i=;i<=n;i++){

             ans += i - -sum(a[i]);

         //    printf("ans=%d\n",ans);

             add(a[i],);

         }

         int minn=INF;

         for(int i=;i<=n;i++){

             ans += n-*a[i] + ;

             minn=min(minn,ans);

         }

         printf("%d\n",minn);

     }

     return ;

 }