#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() 
{
    long long a[4000], b[800000], n, count = 0, p, ans = 0, max; 
    cin>>n;
    for(int i = 0; i<n; i++)
        cin>>a[i];
    for(int i = 0; i<n; i++)
        for(int j = 0; j<(n - i); j++)
        {
            p = i + j;
            max = -1;
            for(int k = j; k<=p; k++)
                if(a[k]>max)
                    max = a[k];
            b[count++] = max;
        }
    for(int i = 0; i<count; i++)
        for(int j = 0; j<(count - i); j++)
        {
            p = i + j;
            max = -1;
            for(int k = j; k<=p; k++)
                if(b[k]>max)
                    max = b[k];
            ans = (ans + max)%1000000007;
        }
    cout<<ans<<endl;
    return 0;
}