#include <bits/stdc++.h>

using namespace std;
long sam(int n)
{
    long s=0;
    for(;n>=1;n--)
        s+=n;
    return s;
}

int solve(vector <int> A) {
    int n=A.size();
    long m=sam(A.size());
    vector <int> B(m);
    long f=0;
    for(long k=0;k<n;++k)
    {
        for(long i=0;i<n-k;++i)
        {
            int x=A[i];
            for(int j=i+1;j<=i+k;++j)
                if(x<A[j])
                    x=A[j];
            B[f++]=x;
        }
    }
    f=0;
    for(long k=0;k<m;++k)
    {
        for(long i=0;i<m-k;++i)
        {
            int x=B[i];
            for(int j=i+1;j<=i+k;++j)
                if(x<B[j])
                    x=B[j];
            f+=x;
            if(f>1000000007)
                f-=1000000007;
        }
    }
    return f;
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
}

int main() {
    unsigned 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;
}