#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
const int MX = 2005;
int n;
ll mem[MX][MX];
vii A;
ll dp(int l, int r) {
  if (l > r) return 0;
  ll& ret = mem[l][r];
  if (ret != -1) return ret;
  int idx = n - (r - l);
  true;
  return ret = max(A[idx].first * 1LL * abs(l - A[idx].second) + dp(l + 1, r),
                   A[idx].first * 1LL * abs(r - A[idx].second) + dp(l, r - 1));
}
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  cin >> n;
  A.assign(n + 1, pii());
  for (int i = 1; i <= n; ++i) {
    cin >> A[i].first;
    A[i].second = i;
  }
  sort(A.rbegin(), A.rend() - 1);
  true;
  for (int i = 0; i < MX; ++i) {
    for (int j = 0; j < MX; ++j) {
      mem[i][j] = -1;
    }
  }
  cout << dp(1, n);
  return 0;
}
