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 sum of S(S(A)) modulo 10^9+7.
        // Brute force is easy
        int n = A.length;
        List<Integer> B = new ArrayList<Integer>();
        for(int k=0;k<n;k++){
            for(int i=0;i<n-k;i++){
                int max = 0;
                int j = i+k;
                for(int ii=i;ii<=j;ii++){
                    max = Math.max(max,A[ii]);
                }
                B.add(max);
            }
        }
        List<Integer> C = new ArrayList<Integer>();
        for(int k=0;k<B.size();k++){
            for(int i=0;i<B.size()-k;i++){
                int max = 0;
                int j = i+k;
                for(int ii=i;ii<=j;ii++){
                    max = Math.max(max,B.get(ii));
                }
                C.add(max);
            }
        }
        
        long sum = 0;
        for(int i=0;i<C.size();i++){
            sum += C.get(i);
            sum %= 1000000007;
        }
        
        return (int)sum;
    }

    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();
    }
}