#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2005;
typedef long long ll;
ll f[maxn],a[maxn];
int n;
int main() {
    freopen("treats.in","r",stdin);
    freopen("treats.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;++ i)scanf("%lld",&a[i]);
    ll ans = 0;
    for(int i = 1;i <= n;++ i) {
        for(int j = i;~ j;-- j) {
            ll x = 0,y = 0;
            if(j)x = f[j - 1] + 1ll * a[j] * i;
            if(j < i)y = f[j] + 1ll * a[n - i + j + 1] * i;
            f[j] = max(x , y);
        }
    }
    for(int i = 0;i <= n;++ i)ans = max(ans , f[i]);
    printf("%lld",ans);
    fclose(stdin);
    fclose(stdout);
    return 0;
}