import java.util.*;
public class Solution 
{
    static int solve(int[] A, int n)
    {
        int m = (n*(n+1))/2;
        int[] arr = new int[m];
        int result = 0;
        long sum = 0;
        long div = 1000000007;
        int a = 0;
        for (int i=0; i<n; i++) 
        {
            for (int j=0 ; j<n-i ; j++)
            {
                int k = i + j;
                int max = 0;
                for (int l=j; l<=k; l++)
                {
                    if (A[l] > max)
                        max = A[l];
                }
                arr[a] = max;
                a++;
            }
        }
        for (int i=0; i<m; i++) 
        {
            for (int j=0 ; j<m-i ; j++)
            {
                int k = i + j;
                int max = 0;
                for (int l=j; l<=k; l++)
                {
                    if (arr[l] > max)
                        max = arr[l];
                }
                sum = (sum + max ) % div;               
            }
        }
        result = (int) sum;
        return result;
    }
    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        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, n);
        System.out.println(result);
        in.close();
    }
}