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

public class Solution {
    
    static int[] subArray(int[] src, int i, int j){
        return Arrays.copyOfRange(src, i, j+1);
    }
    
    static int[] maxTransform(int[] src){
        List<Integer> result = new LinkedList<>();
        int maxK = src.length -1;
        for (int k = 0; k <= maxK; k++){
            int maxI = src.length -k -1;
            for (int i = 0; i <= maxI; i++){
                int j = i + k;
                result.add(Arrays.stream(subArray(src, i, j)).max().getAsInt());
            }
        }
        return result.stream().mapToInt(i->i).toArray();
    }

    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        int[] solutionArray = maxTransform(maxTransform(A));
        int modulo = ((int)Math.pow(10, 9) + 7);

        int result = 0;
        for (int i : solutionArray){
            result = (result + i) % modulo;
        }
        return result;
    }

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