#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cmath>

#include<algorithm>

#include<cstring>

#include<cstring>

#include<vector>

#include<queue>

#include<stack>

using namespace std;

int v[];

int dp[][];

int main()

{

    int n;

    scanf("%d",&n);

    for(int i=;i<=n;++i)

      scanf("%d",&v[i]);

    memset(dp,,sizeof(dp));

    for(int k=n-;k>=;--k)

    {

        for(int i=;i+k-<=n;++i)

        {

            if(i>)

            dp[i][i+k-]=max(dp[i][i+k-],dp[i-][i+k-]+v[i-]*(n-k));

            if(i+k-<n)

            dp[i][i+k-]=max(dp[i][i+k-],dp[i][i+k]+v[i+k]*(n-k));

        }

    }

    int ans=;

    for(int i=;i<=n;i++)

       ans=max(ans,dp[i][i]+v[i]*n);

    printf("%d\n",ans);

    return ;

}