#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int solve(int n, int a[]) {
	int m=n*(n+1)/2;
	int s1[m];
	int i,j,k,l,m1=m;
	for(k=0;k<n;k++)
	{
		for(i=0;i<(n-k);i++)
		{
			j=i+k;
			int max=a[i];
			for(l=i;l<=j;l++)
			{
				if(a[l]>max)
				max=a[l];
			}
			s1[--m]=max;
		}
	}
	int p=m1*(m1+1)/2;
	int p1=p;
	int s2[p];
	for(k=0;k<m1;k++)
	{
		for(i=0;i<(m1-k);i++)
		{
			j=i+k;
			int max=s1[i];
			for(l=i;l<=j;l++)
			{
				if(s1[l]>max)
				max=s1[l];
			}
			s2[--p]=max;
		}
	}
	long long int sum=0;
	unsigned long int M=1000000007;
	for(i=0;i<p1;i++)
	sum=sum+s2[i];
	sum=sum%M;
	return sum;
    //  Return the sum of S(S(A)) modulo 10^9+7.
}

int main() {
    int n,i; 
    scanf("%d", &n);
   int a[n];
    for (i = 0;i<n;i++) {
       scanf("%d",&a[i]);
    }
    int result = solve(n, a);
    printf("%d\n", result);
    return 0;
}