#include <bits/stdc++.h>

 #define debug(x) cout << #x << ": " << x << endl

 using namespace std;

 typedef long long ll;

 const int MAXN=1e5+;

 const int INF=0x3f3f3f3f;

 const int MOD=1e9+;

 int a[MAXN],L[MAXN],R[MAXN];

 struct BIT

 {

     int c[MAXN];

     void init() {memset(c,,sizeof(c));}

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

     void add(int i,int x)

     {

         while(i<MAXN)

         {

             c[i]+=x;

             i+=lowbit(i);

         }

     }

     ll sum(int i)

     {

         ll res=;

         while(i)

         {

             res+=c[i];

             i-=lowbit(i);

         }

         return res;

     }

 }tree;

 int main()

 {

     ios::sync_with_stdio(false);

     cin.tie();

     int n;

     cin>>n;

     for(int i=;i<=n;++i) cin>>a[i];

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

     {

         tree.add(a[i],);

         L[i]=i-tree.sum(a[i]);

     }

     tree.init();

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

     {

         tree.add(a[i],);

         R[i]=n-i+-tree.sum(a[i]);

     }

     ll ans=;

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

         ans+=min(L[i],R[i]);

     cout<<ans<<endl;

     return ;

 }