#include<fstream>
#include<algorithm>
#define N 605
using namespace std;
ifstream f("barman.in");
ofstream g("barman.out");
int i,j,k,n,sol,x,a[N],b[N],c[N],d[N];
int main()
{
    f>>n;
    for(i=1;i<=n;++i)
    f>>a[i],b[i]=a[i];
    sort(b+1,b+n+1);
    sol=999999999;
    for(i=1;i<=n;++i)
    {
        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])
        for(k=1;k<=n;++k)
        if(a[j]==b[k]&&!c[k])
        {
            x+=abs(k-j)+20;
            c[k]=b[k];
            break;
        }
        sol=min(sol,x);
        x=b[n];
        for(j=n;j;--j)
        b[j]=b[j-1];
        b[1]=x;
    }
    g<<sol<<'\n';
    return 0;
}
 /*   for (ni=1;ni<=n;ni++) {
        permuta(ni);
        D.erase(D.begin(),D.end());
        for (i=1;i<=n;i++)
            if (v[i]!=p[i])
                sol+=20,D[v[i]].push_back(i);
        for (i=1;i<=n;i++)
            if (v[i]!=p[i]) {
                sol+=poz(i-D[p[i]].front());
                D[p[i]].pop_front();
            }
        ANS=min(ANS,sol);
    }*/