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.
		int[] A1 = transform(A);
		int[] A2 = transform(A1);
		//System.out.print("A: ");Arrays.stream(A).forEach((i) -> {System.out.print(i+",");});System.out.println("");
		//System.out.print("A1: ");Arrays.stream(A1).forEach((i) -> {System.out.print(i+",");});System.out.println("");
		//System.out.print("A2: ");Arrays.stream(A2).forEach((i) -> {System.out.print(i+",");});System.out.println("");
		int max = (int) Math.pow(10, 9) + 7;
		int res = Arrays.stream(A2).sum();
		return res > max ? res % max : res;
	}

	static int[] transform(int[] A) {
		int size = A.length;
		int len = (int) Math.pow(size, 2) - size - 1;
		List res = new ArrayList(len);
		for (int k = 0; k <= size - 1; k++) {
			for (int i = 0; i <= size - k - 1; i++) {
				int j = Math.min(i + k, size);
				//System.out.println(" I : " + i + " and k: " + k + " and j: " + j);
				if (i == j)
					res.add(A[i]);
				else{
					res.add(Arrays.stream(Arrays.copyOfRange(A, i, j+1)).max().getAsInt());
				}
			}
		}
		return res.stream().mapToInt(i -> (int) i).toArray();
	}
    
    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();
    }
}