#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define sp ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define mp make_pair
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define priority_queue pq
#define inf (ll)1e15
#define test cout<<"abcd\n";
#define pi pair<int,int>
#define pii pair<int,pi>
#define pb push_back
#define mxn 200005
ll tree[4*mxn],a[mxn];

void build(int i,int l,int r){
if(l==r){
    tree[i]=a[l];
    return;
}
int m=(l+r)>>1;
build(i+i,l,m),build(i+i+1,m+1,r);
tree[i]=max(tree[i+i],tree[i+i+1]);
}
ll query(int i,int l,int r,int x,int y){
if(l>r||l>y||r<x) return 0;
if(l>=x&&r<=y) return tree[i];
int m=(l+r)>>1;
return max(query(i+i,l,m,x,y),query(i+i+1,m+1,r,x,y));
}

int main(){
    sp;

ll n,n1,n2,k=0,mmax=0;
cin>>n;
int j;
n1=(n*(n+1))/2;
for(ll i=1; i<n;++i)
    k=(k+n1+1-i);
n2=(n1*(n1+1))/2;
k=(n2-k)%mod;
for(int i=1; i<=n; ++i){
        cin>>a[i];
       mmax=max(a[i],mmax);
}
vector<ll> b;
build(1,1,n);
for(int k=0; k<n; ++k)
    for(int i=0; i<n-k; ++i){
        j=k+i;
        if(i==j)
            b.pb(a[i+1]);
        else
        b.pb(query(1,1,n,i+1,j+1));
}
ll ans=0;
for(int i=0; i<n1; ++i) ans+=b[i];
ll p=(mmax*k)%mod;
ans=(ans+p)%mod;
for(int i=2; i<n; ++i){
    for(int j=0; j<=n1-i; ++j){
        ll temp=0;
        for(int m=0; m<i; ++m)
            temp=max(b[j+m],temp);
        ans=(ans+=temp)%mod;
    }
}
cout<<ans;
return 0;}