#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
struct PrimalDual {
  const long long INF;
  struct edge {
    int to;
    long long cap;
    long long cost;
    int rev;
    bool isrev;
  };
  vector<vector<edge> > graph;
  vector<long long> potential, min_cost;
  vector<int> prevv, preve;
  PrimalDual(int V) : graph(V), INF(numeric_limits<long long>::max()) {}
  void add_edge(int from, int to, long long cap, long long cost) {
    graph[from].push_back({to, cap, cost, (int)graph[to].size(), false});
    graph[to].push_back({from, 0, -cost, (int)graph[from].size() - 1, true});
  }
  long long min_cost_flow(int s, int t, long long f) {
    int V = (int)graph.size();
    long long ret = 0;
    using Pi = pair<long long, int>;
    priority_queue<Pi, vector<Pi>, greater<Pi> > que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);
    while (f > 0) {
      min_cost.assign(V, INF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while (!que.empty()) {
        Pi p = que.top();
        que.pop();
        if (min_cost[p.second] < p.first) continue;
        for (int i = 0; i < graph[p.second].size(); i++) {
          edge& e = graph[p.second][i];
          long long nextCost = min_cost[p.second] + e.cost +
                               potential[p.second] - potential[e.to];
          if (e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if (min_cost[t] == INF) return -1;
      for (int v = 0; v < V; v++) potential[v] += min_cost[v];
      long long addflow = f;
      for (int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for (int v = t; v != s; v = prevv[v]) {
        edge& e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }
  void output() {
    for (int i = 0; i < graph.size(); i++) {
      for (auto& e : graph[i]) {
        if (e.isrev) continue;
        auto& rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/"
             << rev_e.cap + e.cap << ")" << endl;
      }
    }
  }
};
int main(void) {
  long long n;
  cin >> n;
  vector<long long> as(n);
  for (long long i = 0; i < n; i++) {
    cin >> as[i];
  }
  PrimalDual g(2 * n + 2);
  for (long long from = 0; from < n; from++) {
    for (long long to = 0; to < n; to++) {
      long long m = abs(from - to);
      g.add_edge(from, to + n, 1, -m * as[from]);
    }
  }
  for (long long to = 0; to < n; to++) {
    g.add_edge(2 * n, to, 1, 0);
  }
  for (long long to = 0; to < n; to++) {
    g.add_edge(to + n, 2 * n + 1, 1, 0);
  }
  auto p = g.min_cost_flow(2 * n, 2 * n + 1, n);
  cout << -p << endl;
  return 0;
}
