#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <list>
#include <numeric>
using namespace std;

void solve(const vector<uint64_t> &A, vector<uint64_t> &B) {
    for (int k = 0; k < A.size(); ++k) {
        for (int i = 0; i < A.size() - k; ++i) {
            int j = i + k;
            
            int e = *max_element(A.begin() + i, A.begin() + j + 1);
            B.emplace_back(e);
        }
    }
}

int main() {
    uint64_t n;
    
    cin >> n;
    
    vector<uint64_t> A(n, 0), B, C;
    
    for (uint64_t i = 0; i < n; ++i) {
        cin >> A[i];
    }
    
    solve(A, B);
    solve(B, C);

    cout << accumulate(C.begin(), C.end(), 0) << endl;
    
    return 0;
}