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[] B = new int[A.length * (A.length + 1) / 2];
        int index = 0;
        for(int k = 0 ; k < A.length ; k++) {
            for(int i = 0 ; i < A.length - k ; i++) {
                int j = i + k;
                int t = A[j];
                for(int z = i ; z <= j ; z++) {
                    if(A[z] > t) {
                        t = A[z];
                    }
                }
                B[index] = t;
                index++;
            }
        }
        
        
        int[] C = new int[B.length * (B.length + 1) / 2];
        index = 0;
        for(int k = 0 ; k < B.length ; k++) {
            for(int i = 0 ; i < B.length - k ; i++) {
                int j = i + k;
                int t = B[j];
                for(int z = i ; z <= j ; z++) {
                    if(B[z] > t) {
                        t = B[z];
                    }
                }
                C[index] = t;
                index++;
            }
        }
        
        long sum = 0;
        
        for(int i = 0 ; i < C.length ; i++) {
            sum = (sum + C[i]) % 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();
    }
}