#include <bits/stdc++.h>
using ll = long long;
const ll MOD = 998244353;
const int INF = (ll)1e9 + 7;
const ll INFLL = (ll)1e18;
using namespace std;
template <class t>
using vvector = vector<vector<t>>;
template <class t>
using vvvector = vector<vector<vector<t>>>;
template <class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template <class t, class u>
bool chmax(t &a, u b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class t, class u>
bool chmin(t &a, u b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
namespace templates {
ll modpow(ll x, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = res * x % MOD;
    x = x * x % MOD;
    b >>= 1;
  }
  return res;
}
ll modinv(ll x) { return modpow(x, MOD - 2); }
bool was_output = false;
template <class t>
void output(t a) {
  if (was_output) cout << " ";
  cout << a;
  was_output = true;
}
void outendl() {
  was_output = false;
  cout << endl;
}
ll in() {
  ll res;
  scanf("%lld", &res);
  return res;
}
template <class t>
istream &operator>>(istream &is, vector<t> &x) {
  for (auto &i : x) is >> i;
  return is;
}
template <class t, class u>
istream &operator>>(istream &is, pair<t, u> &x) {
  is >> x.first >> x.second;
  return is;
}
template <class t>
void in(t &x) {
  cin >> x;
}
template <class t>
t in() {
  t res;
  cin >> res;
  return res;
}
template <class t>
void out(t x) {
  cout << x;
}
template <class t>
vector<t> sorted(
    vector<t> line,
    function<bool(t, t)> comp = [](t a, t b) { return a < b; }) {
  sort(line.begin(), line.end(), comp);
  return line;
}
template <class t>
vector<t> reversed(vector<t> line) {
  reverse(line.begin(), line.end());
  return line;
}
}  // namespace templates
using namespace templates;
int main() {
  int n = in();
  vector<pair<long long, long long>> line;
  for (int i = (n) * (strlen("") != 0); i < (int)(strlen("") ?: (n)); ++i)
    line.emplace_back(in(), i);
  sort((line).begin(), (line).end(), greater<pair<long long, long long>>());
  function<ll(int, int)> func = [&](int l, int r) -> ll {
    if (l > r) return 0;
    vvector<ll> dp(n, vector<ll>(n, -1));
    ll &res = dp[l][r];
    if (res >= 0) return res;
    int p = l + n - r - 1;
    int place = line[p].second;
    int score = line[p].first;
    chmax(res, abs(place - l) * score + func(l + 1, r));
    chmax(res, abs(place - r) * score + func(l, r - 1));
    return res;
  };
  cout << func(0, n - 1) << endl;
  return 0;
}
