#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9 + 7;
constexpr lint mod2 = 998244353;
int main() {
  int n, l = 0, r;
  lint s = 0;
  cin >> n;
  r = n - 1;
  vector<pii> v(n);
  for (int i = 0; i < n; ++i) {
    cin >> v[i].first;
    v[i].second = i;
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  for (int i = 0; i < n; ++i) {
    if (abs(v[i].second - l) > abs(r - v[i].second)) {
      s += v[i].first * abs(v[i].second - l);
      ++l;
    } else if (abs(v[i].second - l) < abs(r - v[i].second)) {
      s += v[i].first * abs(r - v[i].second);
      --r;
    } else if (i < n - 1 && v[i + 1].second < v[i].second) {
      s += v[i].first * abs(v[i].second - l);
      ++l;
    } else if (i < n - 1 && v[i + 1].second > v[i].second) {
      s += v[i].first * abs(r - v[i].second);
      --r;
    } else {
      s += v[i].first * abs(v[i].second - l);
      ++l;
    }
  }
  cout << s << endl;
  return 0;
}
