#include <bits/stdc++.h>

using namespace std;

int solve(vector <int> A) {
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
    vector <int> B;
    int sum=0;
    for(int k=0;k<=A.size()-1;k++){
        for(int i=0;i<=A.size()-k-1;i++){
            int j=i+k;
            int max=0;
            for(int p=i;p<=j;p++){
                if(A[p]>=max){
                    max=A[p];
                    
                }
                
            }
            B.push_back(max);
            
        }
    }
    vector <int> C;
    
    for(int k=0;k<=B.size()-1;k++){
        for(int i=0;i<=B.size()-k-1;i++){
            int j=i+k;
            int max=0;
            for(int p=i;p<=j;p++){
                if(B[p]>=max){
                    max=B[p];
                    
                }
                
            }
            C.push_back(max);
            
        }
    }
        
   for(int kp=0;kp<C.size();kp++){
            //cout<<C[kp]<<" ";
        }
        
        for(int kp=0;kp<C.size();kp++){
            sum=sum+C[kp];
        }
    
    
    
    return sum;
    
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    int count=0;
    int result = solve(a);
    cout << result << endl;
    return 0;
}