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

public class Solution {

    static int solve(int[] A) {
        final int mod = 1000000007;
        return sum(maxTransform(maxTransform(A))) % mod;
        // I know this is stupidly slow and memory-hungry, it's just a test
        //  Return the length of the longest possible sequence of moves modulo 10^9+7
    }

    static int[] maxTransform(int[] A){
        ArrayList<Integer> B = new ArrayList<Integer>();
        for(int k = 0; k < A.length; k++){
            for(int i = 0; i < A.length - k; i++){
                int j = i + k;
                B.add(findMax(A, i, j));
            }
        }
        return B.stream().mapToInt(i -> i).toArray();
    }

    static int findMax(int[] arr, int start, int end){
        int max = arr[start];
        for(int i = start + 1; i <= end; i++){
            if(max < arr[i])
                max = arr[i];
        }
        return max;
    }

    static int sum(int[] arr) {
        int sum = 0;
        for (int el : arr)
            sum += el;
        return 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();
    }
}