#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int n, a[128], ans=2000000000;
int main()
{
    freopen ("sortmach.in", "r", stdin);
    freopen ("sortmach.out", "w" , stdout);
    scanf("%d",&n);
    for (int i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    for (int i=1; i<=n; i++)
    {
        int sum=0;
        for (int j=1; j<=n; j++)
        {
            int p=i, q=j;
            p=min(i,j);
            q=max(i,j);
            sum+=a[j]*min(q-p,n-q+p);
        }
        ans=min(ans, sum);
    }
    printf("%d\n", ans);
    return 0;
}