#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void pre() {}
void solve() {}
int dp[2009][2009];
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  pre();
  vector<pair<int, int> > a;
  int n;
  cin >> n;
  a.resize(n, {0, 0});
  for (int i = 0; i < (n); ++i)
    cin >> a[i].first, a[i].first *= -1, a[i].second = i;
  sort(a.begin(), a.end());
  for (int s = 1; s <= (n); ++s)
    for (int l = 0; l <= (n - s); ++l) {
      int r = l + s;
      dp[l][r] = max(dp[l][r], a[n - s].first * -1 * abs(a[n - s].second - l) +
                                   dp[l + 1][r]);
      dp[l][r] =
          max(dp[l][r], a[n - s].first * -1 * abs(a[n - s].second - r + 1) +
                            dp[l][r - 1]);
    }
  cout << dp[0][n];
  return 0;
}
