#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
inline ll randint(ll a, ll b) {
  ll w = (_g() << 31LL) ^ _g();
  return a + w % (b - a + 1);
}
inline void fast_io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
};
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const pair<T, S> p) {
  cout << "[" << p.first << ";" << p.second << "]";
  return os;
}
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const map<T, S> p) {
  for (auto el : p) cout << "[" << el.first << ";" << el.second << "]";
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
int N;
vector<ll> A;
priority_queue<pll> pq;
void input() {
  fast_io();
  cin >> N;
  for (int i = 0; i < N; i++) {
    ll a;
    cin >> a;
    A.push_back(a);
    pq.emplace(a, i);
  }
}
int solve() {
  ll ans = 0;
  vector<bool> used(N, false);
  vector<ll> changed(N, 0);
  while (!pq.empty()) {
    ll a;
    ll idx;
    tie(a, idx) = pq.top();
    pq.pop();
    ll le = 0;
    ll ri = N - 1;
    while (used[le]) le++;
    while (used[ri]) ri--;
    if (abs(ri - idx) > abs(idx - le)) {
      changed[ri] = a;
      ans += a * abs(ri - idx);
      used[ri] = true;
    } else {
      changed[le] = a;
      ans += a * abs(le - idx);
      used[le] = true;
    }
  }
  ll ans2 = 0;
  vector<bool> seen(N, false);
  for (int i = 0; i < N; i++) {
    for (int j = N - 1; j >= 0; j--) {
      if (seen[j]) continue;
      if (A[i] == changed[j]) {
        ans2 += A[i] * abs(i - j);
        seen[j] = true;
        break;
      }
    }
  }
  cout << max(ans, ans2) << endl;
  return 0;
}
int main() {
  input();
  solve();
  return 0;
}
