//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimization ("O3")
//~ #pragma GCC optimization ("unroll-loops")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("avx,avx2,fma")
//~ #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//~ #pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX

#include <bits/stdc++.h>
using namespace std;
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline bool uin(T &x, T y) {return (y < x) ? x = y, true : false;}
#ifdef Rahul
# define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
  stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#else
# define error(...) 42;
#endif
string to_string(char c) { return "'" + string(1, c) + "'";}
string to_string(string s) { return '"' + s + '"';}
string to_string(const char* s) { return to_string((string) s);}
template<typename A> string to_string(A);
template<typename A, typename B> string to_string(pair<A, B> p){
  return "(" + to_string(p.first) + ": " + to_string(p.second) + ")";}
template<typename A> string to_string(A v) {bool f = false; string r = "{"; 
  for (auto x: v) {if (f) r += ", "; r += to_string(x); f = true;} return r += "}";}
template<typename A> string to_string(vector<vector<A>> v) {string r; 
  for (auto x: v) r += "\n" + to_string(x); return r;}
int Nerr;
template<typename A> string to_string(A *p) {return to_string(vector<A>(p, p + Nerr));}
void err(istream_iterator<string>) { cerr << endl; }
template<typename T,typename... Args> void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " =: " << to_string(a) << "; "; err(++it, args...); }
template<typename T> void kek(T ans) {cout << ans << endl; exit(0);}
#define Lu(...) [&] (auto &&u) { return __VA_ARGS__; }
#define Luv(...) [&] (auto &&u, auto &&v) { return __VA_ARGS__; }
int const MOD = 1e9 + 7;
i64 const INF = 1e18 + 42;
/***********************************************************************/
const int N = 2010;
pair<i64,int> a[N];

int32_t main() {
  cin.tie(nullptr) -> sync_with_stdio(false);

  int n; cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].first;
    a[i].second = i;
  }
  i64 best = -INF;
  for (int i = 1; i < n; ++i) {
    i64 ans = 0;
    vector<pair<i64,int>> b(a + 1, a + 1 + i), c(a + 1 + i, a + 1 + n);
    sort(ALL(b), greater<>());
    sort(ALL(c), greater<>());
    for (int j = 0, k = n; j < SZ(b); ++j, --k) {
      ans += (i64) (k - b[j].second) * b[j].first;
    }
    for (int j = 0; j < SZ(c); ++j) {
      ans += (i64) (c[j].second - j - 1) * c[j].first;
    }
    uax(best, ans);
  }
  cout << best << '\n';
}
