#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 5;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod;
  else
    return (((a) % mod) *
            (power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod)) %
           mod;
}
inline int64_t inverse(int64_t a, int64_t md) {
  a %= md;
  if (a < 0) a += md;
  int64_t b = md, u = 0, v = 1;
  while (a) {
    int64_t t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += md;
  return u;
}
const int64_t ce = 1e9 + 7;
int64_t fast_mod(int64_t input) { return input < ce ? input : input % ce; }
int64_t a[2001];
int64_t sz[2001];
void init(int64_t n) {
  for (int64_t i = 1; i <= n; i++) {
    a[i] = i;
    sz[i] = i;
  }
}
int64_t ans = 0;
void un(int64_t x, int64_t y, int64_t val) {
  if (a[x] == 0) return;
  if (sz[y] == 0) return;
  a[x] = 0;
  sz[y] = 0;
  ans += abs(val);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int64_t n;
  cin >> n;
  init(n);
  int64_t b[n + 1];
  for (int64_t i = 1; i <= n; i++) cin >> b[i];
  vector<pair<int64_t, pair<int64_t, int64_t>>> v;
  for (int64_t i = 1; i <= n; i++) {
    for (int64_t j = 1; j <= n; j++) {
      v.push_back(make_pair(-b[i] * abs(i - j), make_pair(i, j)));
    }
  }
  sort(v.begin(), v.end());
  int64_t fin = 0;
  for (int64_t i = 0; i < v.size(); i++) {
    init(n);
    ans = 0;
    for (int64_t j = i; j < v.size(); j++)
      un(v[j].second.first, v[j].second.second, v[j].first);
    for (int64_t j = 0; j < i; j++)
      un(v[j].second.first, v[j].second.second, v[j].first);
    fin = max(fin, ans);
    break;
  }
  cout << fin;
}
