/*
ID: espr1t
TASK: 
KEYWORDS: 
*/

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
FILE *in; FILE *out;

const int MAX = 128;
const int INF = 1000000001;

int n;
int a[MAX];

int main(void) {
	in = stdin; out = stdout;
	in = fopen("sortmach.in", "rt"); out = fopen("sortmach.out", "wt");
	
	fscanf(in, "%d", &n);
	for (int i = 0; i < n; i++)
	    fscanf(in, "%d", &a[i]);
	
	int ans = INF;
	for (int i = 0; i < n; i++) {
	    int cur = 0;
	    for (int c = 0; c < n; c++) {
	        int dist = min(abs(c - i), n - abs(c - i));
	        cur += dist * a[c];
	    }
	    ans = min(ans, cur);
	}
	fprintf(out, "%d\n", ans);
	
	return 0;
}