#include <bits/stdc++.h>
#pragma GCC optimize("O3")
long mod(long a) {
  long long c = a % (long long)(1e9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1e9 + 7);
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }
  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}
bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}
long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
  using namespace std;
  int n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<pair<long long, int>> vec;
  for (int i = 0; i < n; i++) vec.push_back(pair<long long, int>(a[i], i));
  sort((vec).begin(), (vec).end());
  vector<vector<long long>> dp(n + 1, vector<long long>(n + 1, -(1e17)));
  dp[0][0] = 0;
  for (int s = 0; s < n; s++) {
    for (int x = 0; x <= s; x++) {
      int y = s - x;
      int i = vec[x + y].second;
      int p_i = x;
      dp[x + 1][y] = max(dp[x + 1][y], dp[x][y] + a[i] * (long long)(i - p_i));
      p_i = n - (y + 1);
      dp[x][y + 1] = max(dp[x][y + 1], dp[x][y] + a[i] * (long long)(p_i - i));
    }
  }
  long long ans = 0;
  for (int x = 0; x < n + 1; x++)
    for (int y = 0; y < n + 1; y++)
      if (x + y == n) ans = max(ans, dp[x][y]);
  cout << ans << endl;
  return 0;
}
