#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
const long long int N = 2e3 + 5;
long long int mod = 1e9 + 7;
long long int dx[4] = {0, 0, +1, -1};
long long int dy[4] = {+1, -1, 0, 0};
long long int po(long long int a, long long int b) {
  a %= mod;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long int dp[N][N];
vector<pair<long long int, long long int> > a;
long long int go(long long int pos, long long int l, long long int r) {
  if (pos == (long long int)a.size()) return 0;
  if (dp[pos][l] != -1) return dp[pos][l];
  return max(go(pos + 1, l + 1, r) + a[pos].first * abs(a[pos].second - l),
             go(pos + 1, l, r - 1) + a[pos].first * abs(a[pos].second - r));
}
void solve() {
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    a.push_back({x, i});
  }
  sort(a.rbegin(), a.rend());
  memset(dp, -1, sizeof(dp));
  cout << go(0, 0, n - 1);
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) solve();
  return 0;
}
