#include <bits/stdc++.h> #define int long long using namespace std; int n,p[10004]; int ans; signed main () { cin >> n; for (int i = 1;i <= n;i++) { cin >> p[i]; } for (int l = 1;l <= n;l++) { ans += l * l * p[l]; priority_queue <int> pq,pq2; pq.push(p[l]); for (int r = l + 2;r <= n;r += 2) { pq.push(p[r - 1]); pq.push(p[r]); pq2.push(-pq.top()),pq.pop(); if (pq.top() > pq2.top()) { pq.push(-pq2.top()),pq2.pop(); pq2.push(-pq.top()),pq.pop(); } ans += l * r * pq.top(); } } cout << ans << endl; return 0; }