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

public class Solution {

    static int N = 1000000000 +7;
	static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
		int sum = 0;
        
		
        int[] B = o(A);
        int n = B.length;
        for(int k = 0; k <= n -1; k ++) {
			for(int i = 0; i <= n - k - 1; i++) {
				int j = i + k;
				sum = (sum + max(B,i,j)) % N;
			}
		}
		return sum%N;
    }
	
	static int[] o(int[] A) {
		int n = A.length;
		int m = 0;
		if(n%2 == 0) {
			m = (n + 1) * (n/2);
		}else {
			m = (n + 1) * (n/2) + (n+1)/2;
		}
		int[] B = new int[m];
		int l = 0;
		for(int k = 0; k <= n -1; k ++) {
			for(int i = 0; i <= (n - k - 1); i++) {
				int j = i + k;
				B[l++] = max(A,i,j);
			}
		}
		return B;
	}
	
	static int max(int[] A, int i, int j) {
		int max = Integer.MIN_VALUE;
		for(; i <= j; i++) {
			if(A[i] > max) {
				max = A[i];
			}
		}
		return max;
	}

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