#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T>
using Graph = vector<vector<T>>;
template <typename T>
using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"};
template <typename T>
struct is_plural : false_type {};
template <typename T1, typename T2>
struct is_plural<pair<T1, T2>> : true_type {};
template <typename T>
struct is_plural<vector<T>> : true_type {};
template <typename T>
struct is_plural<complex<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << " " << p.second;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  if (vec.empty()) return os;
  bool pl = is_plural<T>();
  os << vec.front();
  for (auto itr = ++vec.begin(); itr != vec.end(); ++itr)
    os << interval[pl] << *itr;
  return os;
}
bool CoutYN(bool a, string y = "Yes", string n = "No") {
  cout << (a ? y : n) << "\n";
  return a;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
long long modpow(int a, long long n, int mod = MOD) {
  long long ret = 1;
  do {
    if (n & 1) ret = ret * a % mod;
    a = 1LL * a * a % mod;
  } while (n >>= 1);
  return ret;
}
template <typename T>
T GCD(T a, T b) {
  return b ? GCD(b, a % b) : a;
}
template <typename T>
T LCM(T a, T b) {
  return a / GCD(a, b) * b;
}
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
  return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T>
bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
  if (a.first * b.first < 0) return a.first < b.first;
  if (a.first == 0) return a.second >= 0 || b.first > 0;
  if (b.first == 0) return b.second < 0 && a.first < 0;
  return a.second * b.first < a.first * b.second;
}
ll calc(set<pii> &left, set<pii> &right) {
  ll ret = 0;
  auto litr = left.rbegin();
  int l = 0;
  while (litr != left.rend()) {
    ret += 1LL * litr->first * abs(litr->second - l);
    ++litr;
    ++l;
  }
  auto ritr = right.rbegin();
  int r = 0;
  while (ritr != right.rend()) {
    ret += 1LL * ritr->first * abs(ritr->second - r);
    ++ritr;
    ++r;
  }
  return ret;
}
void solve() {
  int n;
  cin >> n;
  vi arr(n);
  cin >> arr;
  set<pii> left, right;
  for (int i = 0; i < (int)(n); ++i) left.emplace(arr[i], i);
  ll ans = calc(left, right);
  for (int i = 0; i < (int)(n); ++i) {
    left.erase({arr[i], i});
    right.emplace(arr[i], n - 1 - i);
    chmax(ans, calc(left, right));
  }
  cout << ans << endl;
}
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}
