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

public class Solution {

    private static final int modulo = 1000000007;
  
    static List<Integer> transform(int[] A){
        
        List<Integer> B = new ArrayList<>();
        int len = A.length;
        int j;
        int max;
        int templen;
        for(int k =0; k < len; k++){
        	templen = len -k;
            for(int i=0; i < templen; i++){
                j = i + k;
                max = A[i];
                for(int kk = i+1; kk <= j; kk++ ){
                    if( A[kk] > max){
                        max = A[kk];
                    }
                }
                B.add(max);
            }
        }
        
        return B;
    }
    
    static long solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.   
        List<Integer> B = transform(A);
        B = transform(B.parallelStream().mapToInt(x->x).toArray()); 
        return B.parallelStream().collect(Collectors.summarizingInt(x->x % modulo)).getSum();    
    }

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