/*
			 written by vishal choudhary
			 email id vishal130.vk@gmail.com
			 at Fri Dec 15 23:56:31 IST 2017 
*/
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define ulli unsigned long long int
#define ll long long 
#define ull  unsigned long long
#define mp make_pair
#define s(n)   scanf("%d",&n)
#define sc(n)  scanf("%c",&n)
#define sl(n)  scanf("%lld",&n)
#define sf(n)  scanf("%lf",&n)
#define ss(n)  scanf("%s",n)
#define p(n)   printf("%d",n)
#define pc(n)  printf("%c",n)
#define pl(n)  printf("%lld",n)
#define pf(n)  printf("%lf",n)
#define ps(n)  printf("%s",n)
#define pn printf("\n")
#define loopf(X,Y) for(int i=X;i<Y;i++)
#define loopb(X,Y) for(int i=X;i>Y;i--)
#define space printf(" ")
#define dout(X) if(X)
#define matrix(rowsize,colsize,type,name) vector<vector<(type)>> name((rowsize),vector<(type)>(colsize));
vector<int> solve(vector<int> & vectA){
        vector<int> vectB;
        int pusy=vectA.size();
        for(int k=0;k<(pusy);k++){
                for(int i=0;i<(pusy-k);i++){
                        int j=i+k;
                        int maxi=INT_MIN;
                        for(int l=i;l<=j;l++)
                                if(vectA[l]>maxi)
                                        maxi=vectA[l];
                        vectB.push_back(maxi);
                }
        }
        return vectB;
}
int main(){
        int n,temp;
        s(n);
        vector<int> vectA;
        for(int i=0;i<n;i++){
                cin>>temp;
                vectA.push_back(temp);
        }
        vector<int> vectB=solve(vectA);
        vector<int> vectC=solve(vectB);
        lli ans=0;
        for(int i=0;i<vectC.size();i++){
                ans+=vectC[i];
                ans%=1000000007;
        }
        pl(ans),pn;
		return 0;
}