#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long kai(long long x, long long y) {
  long long res = 1;
  for (long long i = x - y + 1; i <= x; i++) {
    res *= i;
    res %= 1000000007;
  }
  return res;
}
long long mod_pow(long long x, long long y, long long m) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) {
      res = res * x % m;
    }
    x = x * x % m;
    y >>= 1;
  }
  return res;
}
long long comb(long long x, long long y) {
  if (y > x) return 0;
  return kai(x, y) * mod_pow(kai(y, y), 1000000007 - 2, 1000000007) %
         1000000007;
}
long long n;
pair<long long, long long> a[2010];
long long d[2010][2010];
long long ans;
signed main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a + 1, a + n + 1);
  reverse(a + 1, a + n + 1);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j < i; j++) {
      long long x = abs(a[i].second - (n - (i - j - 1)));
      d[i][j] = max(d[i][j], d[i - 1][j] + a[i].first * x);
    }
    for (long long j = 1; j <= i; j++) {
      long long x = abs(a[i].second - j);
      d[i][j] = max(d[i][j], d[i - 1][j - 1] + a[i].first * x);
    }
  }
  for (long long i = 0; i <= n; i++) ans = max(ans, d[n][i]);
  cout << ans << endl;
}
