#include<fstream>
#include<algorithm>
#define N 605
#define Max 999999999
using namespace std;
ifstream in("barman.in");
ofstream out("barman.out");
int i,j,k,n,sol,a[N],b[N],c[N],d[N];
void solve()
{
    sort(b+1,b+n+1);
    sol=Max;
    for(i=1;i<=n;i++)
    {
        int x=0;
        for(j=1;j<=n;j++)
            c[j]=d[j]=0;
        for(j=1;j<=n;j++)
        {
            if(a[j]==b[j]){d[j]=1,c[j]=a[j];}
        }
        for(j=1;j<=n;j++)
        {
            if(d[j]==0)
            {
                for(k=1;k<=n;k++)
                {
                        if(a[j]==b[k]&&c[k]==0)
                        {
                            x=x+abs(k-j)+20;
                            c[k]=b[k];
                            break;
                        }
                }
            }
        }
        sol=min(sol,x);
        x=b[n];
        for(j=n;j>0;j--)
            b[j]=b[j-1];
        b[1]=x;
    }
    out<<sol<<"\n";
}
int main()
{
    in>>n;
    for(i=1;i<=n;++i)
    {
        in>>a[i],
        b[i]=a[i];
    }
    solve();
    return 0;
}