#include<stdio.h>

 #include<string.h>

 #define MIN(x,y)(x<y?x:y)

 const int MAXN=;

 int a[MAXN],b[MAXN],anser,c[MAXN];

 void mergesort(int l,int r,int mid){

     int i=l,j=mid+,k=l;

     while(i<=mid&&j<=r){

         if(a[i]<=a[j])b[k++]=a[i++];

         else{

             anser+=j-k;

             b[k++]=a[j++];

         }

     }

     while(i<=mid)b[k++]=a[i++];

     while(j<=r)b[k++]=a[j++];

     for(i=l;i<=r;i++)a[i]=b[i];

 }

 void merge(int l,int r){

     if(l<r){

         int mid=(l+r)>>;

         merge(l,mid);

         merge(mid+,r);

         mergesort(l,r,mid);

     }

 }

 int main(){

     int N;

     while(~scanf("%d",&N)){

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

         anser=;

         merge(,N-);

         int temp=anser;

         //printf("%d\n",anser);

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

             temp=temp+(N--*c[i]);

             //printf("%d %d\n",c[i],temp);

             anser=MIN(anser,temp);

         }

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

     }

     return ;

 }

 //n-a-1-(a) N-2*a+1;