/*
ID: Yoana Zelova zelova1
PROG:
LANG: C++
*/
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<fstream>
using namespace std;
long long n,i,k[256],sum,ans=999999999,ok,ab,j,used[256][256];
int main()
{
    /*freopen ("sortmach.in","r",stdin);
    freopen ("sortmach.out","w",stdout);*/
    cin>>n;
    for(i=1; i<=n; i++)
        cin>>k[i];
    ok=n/2;
    for(i=1; i<=n; i++)
    {
        sum=0;
        if(i-ok<1)
        {
            ab=1;
            for(j=1; j<i; j++)
            {
                used[i][j]=1;
                sum+=ab*k[j];
                ab++;
            }
            int ac=ab;
            for(j=n; j>=n-ok+ac; j--)
            {
                used[i][j]=1;
                sum+=ab*k[j];
                ab++;
            }
        }
        else
        {
            ab=1;
            for(j=i-1; j>=i-ok; j--)
            {
                used[i][j]=1;
                sum+=ab*k[j];
                ab++;
            }
        }
        if(ok+i>n)
        {
            ab=1;
            for(j=i+1;j<=n;j++)
            {
                if(used[i][j]==1)break;
                sum+=ab*k[j];
                ab++;
            }
            long long ac=ab;
            for(j=1; j<=ok-ac+1; j++)
            {
                if(used[i][j]==1)break;
                sum+=ab*k[j];
                ab++;
            }
        }
        else
        {
            ab=1;

            for(j=i+1; j<=i+ok; j++)
            {
                if(used[i][j]==1)break;
                sum+=ab*k[j];
                ab++;
            }
        }
        ans=min(ans,sum);
    }
    cout<<ans<<endl;
    return 0;
}