#include <bits/stdc++.h>
using namespace std;
bool RELAXED = false;
template <int, typename T>
struct MINMAX {
  T val;
  MINMAX(T val) : val(val) {}
};
template <typename T>
MINMAX<1, T> MAX(T val) {
  return MINMAX<1, T>(val);
};
template <typename T>
MINMAX<2, T> MIN(T val) {
  return MINMAX<2, T>(val);
};
template <typename T, typename U>
inline T& operator|=(T& lhs, MINMAX<1, U> rhs) {
  return lhs = (rhs.val > lhs ? (RELAXED = true, rhs.val)
                              : (RELAXED = false, lhs));
}
template <typename T, typename U>
inline T& operator|=(T& lhs, MINMAX<2, U> rhs) {
  return lhs = (rhs.val < lhs ? (RELAXED = true, rhs.val)
                              : (RELAXED = false, lhs));
}
template <typename T, typename U>
istream& operator>>(istream& in, pair<T, U>& p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T>
inline vector<T> READ(int n) {
  vector<T> vec(n);
  for (int i = 0; i < int(n); i++) cin >> vec[i];
  return vec;
}
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T> >;
signed long long int dp[2005][2005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout << fixed << setprecision(12);
  int n;
  cin >> n;
  vector<int> a = READ<int>(n);
  vector<pair<int, int> > p;
  for (int i = 0; i < int(n); i++) p.push_back({a[i], i});
  sort((p).begin(), (p).end());
  reverse((p).begin(), (p).end());
  for (int i = 0; i < int(n); i++) {
    pair<int, int> pi = p[i];
    for (int l = 0; l < int(i + 1); l++) {
      int r = n - 1 - i + l;
      dp[i + 1][l + 1] |= MAX(dp[i][l] + pi.first * abs(pi.second - l));
      dp[i + 1][l] |= MAX(dp[i][l] + pi.first * abs(pi.second - r));
    }
  }
  cout << *max_element(dp[n], dp[n] + 2005) << endl;
}
