#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>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
  char buffer[4];
  std::snprintf(buffer, sizeof(buffer), "%03d", num);
  return buffer;
}
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>
inline T sign(T x) {
  return T(x > 0) - T(x < 0);
}
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>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline T fetch() {
  T ret;
  cin >> ret;
  return ret;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
int solve() {
  int N;
  std::cin >> N;
  vector<vector<ll>> v;
  for (int i = 0; i < N; ++i) {
    ll value;
    cin >> value;
    for (int j = 0; j < N; ++j) {
      if (i == j) continue;
      v.push_back({value * abs(i - j), i, j});
    }
  }
std:
  sort(v.begin(), v.end(), std::greater<vector<ll>>());
  vector<bool> doneI(N, false);
  vector<bool> doneJ(N, false);
  ll result = 0;
  for (auto& item : v) {
    if (doneI[item[1]] || doneJ[item[2]]) continue;
    result += item[0];
    doneI[item[1]] = true;
    doneJ[item[2]] = true;
  }
  cout << result << endl;
  return 0;
}
int main() {
  solve();
  return 0;
}
