#include <fstream>
#include <iostream>
#include <algorithm>

using namespace std;

ifstream in("barman.in");
ofstream out("barman.out");
int n;
int v[1205];
int sorted[1205];
int used[1205];
int INF = (1 << 30);

int main()
{
    in>>n;
    for(int i = 1; i<=n; i++)
    {
        in>>v[i];

        sorted[i] = v[i];
    }

    sort(sorted + 1, sorted + n + 1);

    for(int i = 1; i<=n; i++)
    {
        sorted[n + i] = sorted[i];
    }

    int ans = INF;
    for(int start = 1; start <= n; start++)
    {
        for(int i = 1; i<=n; i++)
        {
            used[i] = 0;
        }

        for(int i = 1; i<=n; i++)
        {
            if(sorted[i + start - 1] == v[i])
            {
                used[i] = 1;
            }
        }

        int sum = 0;
        for(int i = 1; i<=n; i++)
        {
            if(sorted[i + start - 1] == v[i])
            {
                continue;
            }

            for(int j = 1; j<=n; j++)
            {
                if(used[j] == 0 && sorted[j + start - 1] == v[i])
                {
                    used[j] = 1;
                    sum += abs(i - j) + 20;
                    break;
                }
            }
        }

        ans = min(ans, sum);
    }

    out<<ans;

    return 0;
}