#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

long long maxP = 1000000007;

void maxTransform(vector<int> &arr,vector<int> &sArr){
	long long n = arr.size();
	int maxE;
	for(long long k=0;k<=n-1;k++){
		
		for(long long i=0;i<=n-k-1;i++){
			
			long long j = i+k;
			maxE = arr[i];
			for(int t=i+1;t<=j;t++){
				maxE = max(arr[t],maxE);
			}
			sArr.push_back(maxE);
		}
	}
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
	int n;
	cin>>n;
	
	vector<int>arr(n,0);
	
	vector<int>sA;
	vector<int>sAA;
	
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	
	
	maxTransform(arr,sA);
	maxTransform(sA,sAA);
	
	long long ind;
	long long sum = 0;
	for(ind=0;ind<sAA.size();ind++){
		sum = (sum+sAA[ind])%maxP;
	}
	
	cout<<sum<<endl;
	
	
	return 0;
}