#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define hii cout << "hii" << endl
#define int ll
#define endl '\n'
#define all(s) s.begin(), s.end()
 
template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; } 
 
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
 
 
const int N = 5e5 + 5;
const int MAXN = 1e5 + 5;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int INF = 1e15;
const int LG = 21;
const long double PI = acos(-1);

int visited[N];
int was[N];

// int get(int l, int r)
// {
// 	if(l == 0) return arr[r];
// 	else return arr[r] - arr[l - 1];
// }

void solve() 
{
	int n;
	cin >> n;
	vector<pair<int, int>> v(n, {0, 0});
	for(int i = 0; i < n; i++)
	{
		int data;
		cin >> data;
		v[i] = {data, i};
	}
	priority_queue<pair<int, pair<int, int>>> pq;
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			int add = v[i].first * abs(i - j);
			pq.push({add, {i, j}});
		}
	}
	int ans = 0;
	while(pq.size())
	{
		pair<int, pair<int, int>> curr = pq.top();
		pq.pop();
		if(visited[curr.second.first] or was[curr.second.second]) continue;
		trace(curr);
		visited[curr.second.first] = 1;
		was[curr.second.second] = 1;
		ans += curr.first;
	}
	cout << ans << endl;
}

 
 
int32_t main() 
{	
    ios_base:: sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	    int t = 1;
	    // cin >> t;
	while(t--)solve();
	return 0;
}