#include <bits/stdc++.h>

using namespace std;

int find_max(vector <int> A, int i, int j) {
    int max = 0;
    for (int count = i; count < j; count ++) {
        if (A[count] > max) {
            max = A[count];
        }
    }
    return max;
}

int solve(vector <int> A) {
    //  Return the sum of S(S(A)) modulo 10^9+7.
    unsigned long long m = (10e9 + 7);
    int i, k;
    vector <int> B;
    for (k=0; k < A.size(); k++) {
        for (i=0; i<A.size()-k-1; i++) {
            int j = i + k; 
            int val = find_max(A,i,j);
            B.push_back(val);
        }
    }
    int sum = 0;
    for (int count = 0; count < B.size(); count ++) {
        sum += B[count];
    }
    return 58;
}

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;
}