#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const ll dx[9] = {0, -1, 0, 1, 1, -1, 1, -1, 0};
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll n;
vpl v;
ll memo[2010][2010];
ll dfs(ll l, ll r) {
  if (l > r) return 0;
  ll now = n - (r + 1 - l);
  ll ret1 = v[now].first * abs(v[now].second - l);
  ll ret2 = v[now].first * abs(v[now].second - r);
  ll ret = max(ret1 + dfs(l + 1, r), ret2 + dfs(l, r - 1));
  memo[l][r] = ret;
  return ret;
}
int main() {
  cin >> n;
  v.resize(n);
  for (ll i = 0; i < n; i++) {
    ll a;
    cin >> a;
    v[i] = {a, i};
  }
  sort((v).begin(), (v).end());
  reverse((v).begin(), (v).end());
  ;
  for (ll i = 0; i < 2010; i++)
    for (ll j = 0; j < 2010; j++) memo[i][j] = -1;
  cout << dfs(0, n - 1) << endl;
}
