#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define read freopen("in.txt", "r", stdin)

#define N 5010

const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;

const int INF= 0x7ffffff;

const int mod =  ;

int bit[N],a[N],n;

int sum(int x){

    int num=;

    while(x>){

        num+=bit[x];

        x-=(x&(-x));

    }

    return num;

}

void add(int x,int d){

    while(x<=n){

        bit[x]+=d;

        x+=(x&(-x));

    }

}

int main()

{

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

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

            scanf("%d",&a[i]);

        }

        memset(bit,,sizeof(bit));

        int total=;

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

            total+=sum(a[i]+);

            add(a[i]+,);

        }

        int minv=total;

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

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

            minv=min(minv,total);

        }

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

    }

return ;

}