#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<long long>>;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
template <typename T>
long long getIndexOfLowerBound(vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T>
long long getIndexOfUpperBound(vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
  is >> p_var.first >> p_var.second;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &df) {
  for (long long i = 0; i < df.size(); i++)
    for (long long j = 0; j < df[i].size(); j++) is >> df[i][j];
  return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  cerr << '{';
  os << pair_var.first;
  cerr << ',';
  os << " " << pair_var.second;
  cerr << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
  cerr << '[';
  for (long long i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  cerr << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto &vec : df) os << vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  cerr << "{";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
  cerr << "{";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() { cerr << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0) cerr << ", ";
  dump_func(std::move(tail)...);
}
struct SegTree {
  long long n;
  vector<long long> node;
  SegTree(vector<long long> v) {
    long long sz = v.size();
    n = 1;
    while (n < sz) n *= 2;
    node.resize(2 * n - 1);
    for (long long i = 0; i < sz; i++) node[i + n - 1] = v[i];
    for (long long i = n - 2; i >= 0; i--)
      node[i] = node[2 * i + 1] + node[2 * i + 2];
  }
  void add(long long number, long long val) {
    number += n - 1;
    node[number] += val;
    while (number > 0) {
      number = (number - 1) / 2;
      node[number] = node[number * 2 + 1] + node[number * 2 + 2];
    }
  }
  long long getsum(long long a, long long b, long long k = 0, long long l = 0,
                   long long r = -1) {
    if (r < 0) r = n;
    if (r <= a || l >= b) return 0;
    if (a <= l && r <= b) return node[k];
    long long vl = getsum(a, b, 2 * k + 1, l, (l + r) / 2);
    long long vr = getsum(a, b, 2 * k + 2, (l + r) / 2, r);
    return vl + vr;
  }
};
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<long long> a(n);
  cin >> a;
  priority_queue<P> pq;
  for (long long(i) = 0; (i) < (n); (i)++) {
    pq.push({a[i], i});
  }
  SegTree seg(a);
  long long l = 0, r = n - 1;
  long long ans = 0;
  while (!pq.empty()) {
    auto p = pq.top();
    pq.pop();
    long long x = p.second, val = p.first;
    seg.add(x, -val);
    if (abs(l - x) * val - seg.getsum(x + 1, INF) >
        abs(r - x) * val - seg.getsum(0, x)) {
      ans += abs(l - x) * val;
      l++;
    } else {
      ans += abs(r - x) * val;
      r--;
    }
  }
  print(ans);
}
