#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


int dp[1001][1001];
pii a[1001];
int n;

int calc(int l, int r)
{
	if (l > r)
		return 0;

	if (dp[l][r] != -1)
		return dp[l][r];

	int i = n + 1 - (r - l + 1);
	int id = a[i].ss;
	int ac = a[i].ff;

	return dp[l][r] = max(calc(l + 1, r) + ac * abs(l - id), calc(l, r - 1) + ac * abs(r - id));
}

int32_t main()
{
	FIO;
	cin >> n;
	memset(dp, -1, sizeof(dp));

	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i].ff;
		a[i].ss = i;
	}

	sort(a + 1, a + n + 1, greater<pii>());

	cout << calc(1, n) << '\n';

	return 0;
}