#include<bits/stdc++.h>
using namespace std;
int n, a[30005], ans;
void dfs(int cnt, int l, int r, int sum) {
	if(l == r + 1) {
        ans = max(ans, sum);
        return ;
    }
    dfs(cnt + 1, l + 1, r, sum + a[l] * cnt);
    dfs(cnt + 1, l, r - 1, sum + a[r] * cnt);
}
signed main() {
	cin >> n;
	for(int i = 1;i <= n;i ++) {
		cin >> a[i];
	}
	dfs(1, 1, n, 0);
	cout << ans;
	return 0;
}