#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++) { int m = p[l]; ans += l * l * m; priority_queue <int> pq,pq2; pq.push(p[l]); for (int r = l + 2;r <= n;r += 2) { int a = p[r - 1],b = p[r]; if (a < m && b < m) { pq.push(a); pq.push(b); pq2.push(-pq.top()); pq.pop(); } else if (a < m || b < m) { if (a < b) { pq.push(a); pq2.push(-b); } else { pq.push(b); pq2.push(-a); } } else { pq2.push(-a); pq2.push(-b); pq.push(-pq2.top()); pq2.pop(); } m = pq.top(); ans += l * r * m; } } cout << ans << endl; return 0; }