/*
LANG:C++11
TASK:skidesign
*/
#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>

#define maxM 202

using namespace std;

int n,arr[101],sum[101];

void inAll()
{
    cin>>n;
    for (int i = 0; i < n; i++)
        cin>>arr[i];
}

void findSol()
{
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            int a = (i < j) ? i + n - j : j + n - i;
            int b = abs(j - i);
            sum[i] += (a < b) ? arr[j]*a : arr[j]*b;
        }
    sort(sum, sum + n);
    cout<<sum[0]<<endl;
}

int main()
{
    freopen ("sortmach.in", "r", stdin);
    freopen ("sortmach.out", "w" , stdout);
    inAll();
    findSol();
    return 0;
}