#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ull unsigned long long
#define ll long long
#define mod 1000000007
#define f(i,n) for( ll (i)= 0;(i)<(n);(i)++)
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define lp pair<ll,ll>
#define mp make_pair
#define mt make_tuple
#define M_H priority_queue<lp ,vector<lp >,greater<lp > >
#define rep(i,j,n) for( ll (i)= j;(i)<(n);(i)++)
#define pb push_back
ll M=pow(10,9)+7;
vector<ll> maxans(vector<ll>a,ll n)
{
    ll mx;
    vector<ll>b;
    f(k,n)
    {
        f(i,n-k)
        {
            ll j=i+k;
            mx=*max_element(a.begin()+i,a.begin()+j+1);
            b.push_back(mx);
        }
    }
    return b;
}
int main()
{
    faster;
    ll n;
    cin>>n;
    vector<ll>a(n);
    f(i,n)
    {
        cin>>a[i];
    }
    vector<ll>c,d;
    c=maxans(a,n);
    d=maxans(c,c.size());
    ll sum=0;
    f(i,d.size())
    {
        sum=(sum%M+d[i]%M)%M;
    }
    cout<<sum<<endl;
    return 0;
}