#include <iostream>
#include <stdio.h>
using namespace std;

int n;
int a[1011];

int ABS(int a)
{
    if (a<0)
    return -a;
    else
    return a;
}

int Eval(int k)
{
    int i;
    int sum=0;

    for (i=1;i<=n;i++)
    {
        if ( ABS(i-k)<n-ABS(i-k) )
        {
            sum+=a[i]*ABS(i-k);
        }
        else
        {
            sum+=a[i]*(n-ABS(i-k));
        }
    }

    return sum;
}

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

    int i;
    int best=999999999,cur;

    scanf("%d",&n);

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

    for (i=1;i<=n;i++)
    {
        cur=Eval(i);

        if (cur<best)
        best=cur;
    }

    printf("%d\n",best);

    return 0;
}