#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <climits>
#include <cstring>
#include <sstream>
#include <cmath>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <utility>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
template<typename T, typename U> static void amax(T &x, U y){if(x<y)x=y;}
template<typename T, typename U> static void amin(T &x, U y){if(x>y)x=y;}
using namespace std;

int main()
{
    int n; scanf("%d",&n);
    vector<int> a(n); rep(i,n)scanf("%d",&a[i]);
    vector<int> b;
    for(int k=0;k<n;k++)
    {
        for(int i=0;i<n-k;i++)
        {
            int x; x=i+k;
            int ma; ma=0;
            for(int j=i;j<=x;j++)amax(ma,a[j]);
            b.push_back(ma);
        }
    }
    vector<int> c; int nn; nn=b.size();
    for(int k=0;k<nn;k++)
    {
        for(int i=0;i<nn-k;i++)
        {
            int x; x=i+k;
            int ma; ma=0;
            for(int j=i;j<=x;j++)amax(ma,b[j]);
            c.push_back(ma);
        }
    }
   // rep(i,b.size())
   //     cout<<b[i]<<" "; cout<<endl;
    int kq; kq=0;
    rep(i,c.size())
    {
        //cout<<c[i]<<" ";
        kq+=c[i];
    } //printf("\n");
    cout<<kq<<endl;
    return 0;
}