#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string.h>
#define INF 2100000000
using namespace std;
typedef int lld;

lld n, box[102];

lld MinDist(lld from, lld to)
{
    lld v1, v2;
    if (from > to) swap(from, to);

    v1 = to-from;
    v2 = n-to + from;

    return min(v1, v2);
}
lld TryWith(lld prim)
{
    lld ret=0;

    for (lld i=1; i<=n; i++)
    {
        if (i == prim) continue;

        ret += MinDist(prim, i)*box[i];
    }

    return ret;
}

int main ()
{
    freopen("sortmach.in", "r", stdin);
    freopen("sortmach.out", "w", stdout);

    scanf("%d", &n);
    for (lld i=1; i<=n; i++)
    {
        scanf("%d", &box[i]);
    }

    lld ans=INF;
    for (lld i=1; i<=n; i++)
    {
        ans = min(ans, TryWith(i));
    }

    printf("%d\n", ans);
}