#include <bits/stdc++.h>
 
using namespace std;
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif


typedef long long ll; 
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
 
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()

const int maxN = (int)2020;

ll dp[maxN][maxN];

bool cmp(pii a, pii b) {
  return a.first < b.first || (a.first == b.first && a.second > b.second);
}

void solve() {
  int n;
  cin >> n;
  vector<pli> a(n);
  for (int i = 0 ; i < n ; i++) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(all(a), cmp);
  reverse(all(a));
  dp[0][0] = 0;
  for (int i = 1 ; i <= n ; i++) {
    int pos = a[i - 1].second;
    ll val = a[i - 1].first;
    for (int l = 0 , r = i; l <= i ; l++, r--) {
      if (l == 0) {
        dp[l][r] = dp[l][r - 1] + abs(n - pos - r + 1) * val;
      } else if (r == 0) {
        dp[l][r] = dp[l - 1][r] + abs(pos - l) * val;
      } else {
        dp[l][r] = max(dp[l - 1][r] + abs(pos - l) * val, dp[l][r - 1] + abs(n - pos - r + 1) * val);  
      }      
      // debug(l, r, dp[l][r], pos, val);
    }
  }
  ll res = 0;
  for (int l = 0 ; l <= n ; l++) {
    res = max(res, dp[l][n - l]);
  }
  cout << res << endl;
}
 
int main() {
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
 
  return 0;
}

Measured memory_bytes: 26364