#include<cstdio>
#include<algorithm>
using namespace std;
int nr[605],v[605];
bool be[605];
int main()
{
    freopen("barman.in","r",stdin);
    freopen("barman.out","w",stdout);
    int n,i,j,q,sc,cu;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
    scanf("%d",&v[i]);
    nr[i]=v[i];
    }
    sort(nr+1,nr+n+1);
    sc=128000000;
    for(q=1;q<=n;q++)
    {
        cu=0;
        for(i=1;i<=n;i++)
        if(v[i]==nr[i])
        be[i]=1;
        else
        {
        be[i]=0;
        cu=cu+20;
        }
        for(i=1;i<=n;i++)
        {
        if(v[i]<nr[i])
        {
            for(j=i;j>=1;j--)
            if(v[i]==nr[j] && be[j]==0)
            {
                be[j]=1;
                cu=cu+min((i-j),j+n-i);
            }
        }
        else
        if(v[i]>nr[i])
        {
             for(j=i;j<=n;j++)
            if(v[i]==nr[j] && be[j]==0)
            {
                be[j]=1;
                cu=cu+min((j-i),i+n-j);
            }
        }
        }
        if(cu<sc)
        sc=cu;
        v[n+1]=v[1];
        for(j=1;j<=n;j++)
        v[j]=v[j+1];
    }
    printf("%d\n",sc);
    return 0;
}