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

public class Solution {

    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        ArrayList<Integer> B = new ArrayList<Integer>();
        int j = 0;
        int result = 0;
        
        for (int k = 0; k < A.length; k++)
        {
            for (int i = 0; i < (A.length - k); i++)
            {
                int max = 0;
                j = i + k;
                
                for (int d = i; d <= j; d++)
                {
                    if(max < A[d])
                        max = A[d];
                }
                B.add(max);
            }
        }
        
        B = superB(B);
        
        for(int d : B)
            result += d;
        
        return result % (int)(Math.pow(10, 9) + 7);
    }
    
    static ArrayList<Integer> superB(ArrayList<Integer> B)
    {
        ArrayList<Integer> C = new ArrayList<Integer>();
        int j = 0;
        
        for (int k = 0; k < B.size(); k++)
        {
            for (int i = 0; i < (B.size() - k); i++)
            {
                int max = 0;
                j = i + k;
                
                for (int d = i; d <= j; d++)
                {
                    if(max < B.get(d))
                        max = B.get(d);
                }
                C.add(max);
            }
        }
        
        return C;
    }

    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);
        System.out.println(result);
        in.close();
    }
}