#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long INF = 1e18;
int mod = 1000000007;
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long pow(long long a, int b) {
  return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
long long modpow(long long a, long long b, long long _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  for (int i = 0; i < ((int)vec.size()); ++i) {
    if (i) os << " ";
    os << vec[i];
  }
  return os;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
  for (int j = 0; j < ((int)v.size()); ++j) is >> v[j];
  return is;
}
template <class T, class T2>
inline void add(T& a, T2 b) {
  a += b;
  if (a >= mod) a -= mod;
}
void solve();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) {
    solve();
  }
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  vector<pair<int, int> > b(n);
  for (int i = 0; i < (n); ++i) b[i] = pair<int, int>(a[i], i);
  sort(b.begin(), b.end(), greater<pair<int, int> >());
  vector<vector<long long> > dp(n + 1, vector<long long>(n + 1));
  for (int z = 0; z < (n); ++z) {
    for (int x = 0; x < (z + 1); ++x) {
      int y = z - x;
      chmax(dp[x + 1][y], dp[x][y] + b[z].first * (b[z].second - x));
      chmax(dp[x][y + 1], dp[x][y] + b[z].first * (n - 1 - y - b[z].second));
    }
  }
  long long ans = 0;
  for (int x = 0; x < (n + 1); ++x) {
    int y = n - x;
    chmax(ans, dp[x][y]);
  }
  cout << ans << '\n';
}
