#include <cstdio>
#include <stack>
#define INF 987654321
using namespace std;
int n, S[10000], ans = INF;
void reverse(int a, int b)
{
    if( a >= b ) return;
    int t = S[a];
    S[a] = S[b];
    S[b] = t;
    reverse(a+1, b-1);
}

int solve()
{

    int ans2 = 0;

    stack<int> ST;

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

    {

        while( !ST.empty() && ST.top() >= S[i] ) ST.pop();

        ans2 += ST.size();

        if( ans2 >= ans ) return ans2;

        ST.push(S[i]);

    }

    return ans2;

}

int main()

{
    freopen(".20.in","r",stdin);
    freopen(".20.out","w",stdout);
    scanf("%d", &n);

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

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

    for(int i = 0 ; i < n-1 ; i++ )

        for(int j = i+1 ; j < n ; j++ )

        {

            reverse(i, j);

            ans = min(ans, solve());

            reverse(i, j);

        }

    printf("%d", ans);

}