#include <bits/stdc++.h>
#pragma GCC optimize("O3")
long mod(long a) {
  long long c = a % (long long)(1e9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1e9 + 7);
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }
  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}
bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}
long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
  using namespace std;
  int n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> to(n, -1);
  int l = 0, r = n - 1;
  for (int _ = 0; _ < n; _++) {
    int mi = -1;
    long long mv = -1;
    for (int i = 0; i < n; i++) {
      if (to[i] >= 0) continue;
      if (mv < a[i]) {
        mi = i;
        mv = a[i];
      }
    }
    if (abs(mi - l) >= abs(r - mi)) {
      to[mi] = l;
      l++;
    } else {
      to[mi] = r;
      r--;
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) ans += a[i] * (long long)abs(to[i] - i);
  cout << ans << endl;
  return 0;
}
