#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  if (a == 0ll) {
    return 0ll;
  }
  a %= MOD;
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a % MOD;
    }
    a = a * a % MOD;
    b >>= 1;
  }
  return ans;
}
long long poww(long long a, long long b) {
  if (a == 0ll) {
    return 0ll;
  }
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
    }
    a = a * a;
    b >>= 1;
  }
  return ans;
}
void Pv(const vector<int> &V) {
  int Len = int(V.size());
  for (int i = 0; i < Len; ++i) {
    printf("%d", V[i]);
    if (i != Len - 1) {
      printf(" ");
    } else {
      printf("\n");
    }
  }
}
void Pvl(const vector<long long> &V) {
  int Len = int(V.size());
  for (int i = 0; i < Len; ++i) {
    printf("%lld", V[i]);
    if (i != Len - 1) {
      printf(" ");
    } else {
      printf("\n");
    }
  }
}
inline long long readll() {
  long long tmp = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar();
  return tmp * fh;
}
inline int readint() {
  int tmp = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar();
  return tmp * fh;
}
void pvarr_int(int *arr, int n, int strat = 1) {
  if (strat == 0) {
    n--;
  }
  for (int i = strat; i <= n; i++) {
    printf("%d%c", arr[i], i == n ? '\n' : ' ');
  }
}
void pvarr_LL(long long *arr, int n, int strat = 1) {
  if (strat == 0) {
    n--;
  }
  for (int i = strat; i <= n; i++) {
    printf("%lld%c", arr[i], i == n ? '\n' : ' ');
  }
}
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
int n;
int a[maxn];
pair<int, int> b[maxn];
bool cmp(pair<int, int> &aa, pair<int, int> &bb) { return aa.first > bb.first; }
int main() {
  n = readint();
  for (int i = 1; i <= n; i++) {
    a[i] = readint();
    b[i] = make_pair(a[i], i);
  }
  sort(b + 1, b + 1 + n, cmp);
  long long ans = 0ll;
  long long temp = 0ll;
  for (int i = 1; i <= n; i++) {
    temp = (b[1].first * (b[1].second - i));
    int l = 1;
    int r = n;
    for (int j = 2; j <= n; j++) {
      if (l == i) l++;
      if (r == i) r--;
      if (abs(b[j].second - l) > abs(r - b[j].second)) {
        temp += abs(b[j].second - l) * b[j].first;
        l++;
      } else {
        temp += abs(b[j].second - r) * b[j].first;
        r--;
      }
    }
    ans = max(ans, temp);
  }
  printf("%lld\n", ans);
  return 0;
}
