#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v;
vector<long long>table;
struct SegmentTree{
vector<int>segTree;
void init(int n){
segTree.resize(4 * n);
}
void Build(int node, int l, int r, vector<int>&v){
if(l == r){
segTree[node] = v[l];
}
else{
int mid = (l + r) >> 1;
Build(node * 2, l, mid, v);
Build(node * 2 + 1, mid + 1, r, v);
segTree[node] = max(segTree[node * 2], segTree[node * 2 + 1]);
}
}
int Query(int node, int l, int r, int ql, int qr){
if(ql <= l && r <= qr)return segTree[node];
if(ql > r || l > qr)return -1;
int mid = (l + r) >> 1;
int lc = Query(node * 2, l, mid, ql, qr);
int rc = Query(node * 2 + 1, mid + 1, r, ql, qr);
return max(lc, rc);
}
};
SegmentTree tree;
long long rec(int indx){
long long res = 1e18;
if(indx == n + 1)return 0;
if(table[indx] != -1)return table[indx];
for(int i = indx;i <= n;++i){
res = min(res, (long long)(n - indx + 1) * tree.Query(1, 1, n, indx, i) + rec(i + 1));
}
return table[indx] = res;
}
int main()
{
cin >> n;
v.resize(n + 1);
table.assign(n + 1, -1);
for(int i = 1;i <= n;++i)cin >> v[i];
tree.init(n);
tree.Build(1, 1, n, v);
cout << rec(1);
}
