#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void smin(T &a, T b) {
  a = a < b ? a : b;
}
template <typename T>
inline void smax(T &a, T b) {
  a = a > b ? a : b;
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << ", ";
  err(++it, args...);
}
template <typename T>
inline void Int(T &n) {
  n = 0;
  int f = 1;
  register int ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';
  n = n * f;
}
template <typename T, typename TT>
inline void Int(T &n, TT &m) {
  Int(n);
  Int(m);
}
template <typename T, typename TT, typename TTT>
inline void Int(T &n, TT &m, TTT &l) {
  Int(n, m);
  Int(l);
}
const int mod = (int)1e9 + 7;
inline int add(int a, int b) {
  a += b;
  return a >= mod ? a - mod : a;
}
inline int sub(int a, int b) {
  a -= b;
  return a < 0 ? a + mod : a;
}
inline int mul(int a, int b) { return (long long)a * b % mod; }
const int inf = (int)2e9 + 5;
const long long Inf = (long long)2e18 + 5;
const int N = (int)2e5 + 5;
const double pi = acos(-1.0);
std::vector<int> g[N];
int sz[N];
void dfs(int u, int p = -1) {
  sz[u] = 1;
  for (int v : g[u]) {
    if (p != v) {
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
}
int solve() {
  int n;
  Int(n);
  std::vector<pair<int, int> > a(n);
  for (int i = 0; i < n; i++) {
    Int(a[i].first);
    a[i].second = i;
  }
  sort(a.begin(), a.end());
  reverse(a.begin(), a.end());
  long long ans = 0;
  int left = 0, right = n - 1;
  for (int i = 0; i < n; i++) {
    if (abs(a[i].second - left) > abs(a[i].second - right)) {
      ans += 1LL * a[i].first * abs(a[i].second - left);
      left++;
    } else {
      ans += 1LL * a[i].first * abs(a[i].second - right);
      right--;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
int main() {
  int test = 1, tc = 0;
  while (test--) {
    solve();
  }
  return 0;
}
