#include <bits/stdc++.h>

using namespace std;

vector <int> max_transform (vector<int> A) {
    vector<int> retvec;
    
    for (int k = 0; k < A.size(); k++) {
        for (int i = 0; i < A.size() - k; i++) {
            int j = i + k;
            int max = 0;
            for (int c = i; c <= j; c++) {
                if (A[c] > max)
                    max = A[c];
            }
           
            retvec.push_back(max);
        }
    }
    //for (int h = 0; h < retvec.size(); h++) {
    //   cout << retvec[h] << ' ';    
    //}
    //cout << endl;

    return retvec;
}

int solve(vector <int> A) {
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
    vector <int> i = max_transform (max_transform (A));
    int sum = 0;
    for (int h = 0; h < i.size(); h++) {
        sum += i[h];
    }
    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 result = solve(a);   
    cout << result << endl;
    return 0;
}