#include <bits/stdc++.h>

using namespace std;
vector<int> max_transform(vector <int> A)
{
    int i,j,k,l;
    vector <int> B;
    for(k=0;k<A.size();k++)
    {
        for(i=0;i<A.size()-k;i++)
        {
            int m=-99999;
            j=i+k;
            for(l=i;l<=j;l++)
            {
                m=max(m,A[l]);
            }
            B.push_back(m);
        }
    }
    return B;
}

int solve(vector <int> A) {
    long i;
    long sum=0;
    vector <int> C;
    C=max_transform(max_transform(A));
    for(i=0;i<C.size();i++)
    {
        sum=sum+C[i];
    }
    return sum%(1000000007);
    
    //  Return the sum of S(S(A)) modulo 10^9+7.
}

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