import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int findMax(int i,int j,int A[])
    {
        int t,max=Integer.MIN_VALUE;
        for(t=i ; t<=j ; t++)
        {
            if(max < A[t])
            {
                max = A[t];
            }
        }
        return max;
    }
    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        int k,j,i,t=0,p=0,sum=0;
        int B[] = new int[10000];
        for(k=0 ; k<=A.length-1 ; k++)
        {
            for(i=0 ; i<=A.length-k-1 ; i++)
            {
                j = i+k;
                B[t++] = findMax(i,j,A);
            }
        }
        int C[] = new int[10000];
        for(k=0 ; k<=t-1 ; k++)
        {
            for(i=0 ; i<=t-k-1 ; i++)
            {
                j = i+k;
                C[p++] = findMax(i,j,B);
            }
        }
        for(i=0 ; i<p ; i++)
        {
            sum = sum + C[i];
        }
        sum = (int)(sum % (int)(Math.pow(10,9)+7));
        return sum;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        //System.out.println("Hello");
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = solve(a);
        System.out.println(result);
        in.close();
    }
}