#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define NFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
#define ll long long
#define F first
#define PI 3.14159265358979323846264338327
#define S second
#define all(v) v.begin(),v.end()
#define trace(x) cout << '>' << #x << ':' << x << endl;
#define trace2(x,y) cout<< '>' << #x << ':' << x << " | " << #y << ':' << y << endl;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define MOD 1000000007
using namespace std;
ll arr[400005];
ll tree[4000005];
void build(ll nd,ll st,ll en)
{
	if(st==en)
	{
		tree[nd]=arr[st];
		return ;
	}
	ll mid=st+en>>1;
	build(2*nd,st,mid);
	build(2*nd+1,mid+1,en);
	tree[nd]=max(tree[2*nd],tree[2*nd+1]);
}
ll qry(ll nd,ll st,ll en,ll l,ll r)
{
	if(l>en||r<st)
	return 0ll;
	if(st>=l&&en<=r)
	return tree[nd];
	ll mid=st+en>>1;
	return max(qry(2*nd,st,mid,l,r),qry(2*nd+1,mid+1,en,l,r));
}
vector<ll> solve(vector<ll>a)
{
	for(int i=0;i<a.size();++i)
	{
		arr[i+1]=a[i];
	}
	build(1,1,a.size());
	vector<ll>b;
	FOR(k,0,a.size()-1)
	{
		FOR(i,0,a.size()-k-1)
		{
			ll j=i+k;
			b.pb(qry(1,1,a.size(),i+1,j+1));
		}
	}
	
	return b;
}
int main()
{
    fast;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ll t,n,m,x,y;
    cin>>n;
    vector<ll>a;
    FOR(i,1,n){cin>>arr[i];a.pb(arr[i]);}
    
    vector<ll>b=solve(solve(a));
    ll sum=0;
    for(auto i:b)sum+=i;
    cout<<sum<<endl;




return 0;
}