#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #define ll long long

 using namespace std;

 const int maxn=;

 struct zs{int v,id;}a[maxn];

 int mp[maxn],t[maxn],t1[maxn];

 ll ans;

 int i,j,k,n,m,cnt;

 int ra;char rx;

 inline int read(){

     rx=getchar(),ra=;

     while(rx<''||rx>'')rx=getchar();

     while(rx>=''&&rx<='')ra=ra*+rx-,rx=getchar();return ra;

 }

 bool cmp(zs a,zs b){return a.v<b.v;}

 int main(){

     n=read();register int j;int x,y;

     for(i=;i<=n;i++)a[i].v=read(),a[i].id=i;

     sort(a+,a++n,cmp);

     for(i=;i<=n;mp[a[i].id]=cnt,i++)cnt+=a[i].v!=a[i-].v;

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

         j=mp[i];while(j<=cnt)t1[j]++,j+=j&-j;

     }

     for(i=n;i>;i--){

         j=mp[i];while(j<=cnt)t1[j]--,j+=j&-j;

         x=n-i,y=i-;

         j=mp[i];while(j)x-=t[j],y-=t1[j],j-=j&-j;

         ans+=x<y?x:y;

         j=mp[i];while(j<=cnt)t[j]++,j+=j&-j;

     }

     printf("%lld\n",ans);

 }