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 (int) (STran(A) % 1000000007);
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }

    private static long STran(int[] a) {
        List<Integer> B = getSOf(a);
        List<Integer> SB = getSOf(B);

        long sum = 0;

        for (Integer num : SB) {
            sum += num;
        }

        return sum;
    }

    private static List<Integer> getSOf(List<Integer> a){
        List<Integer> B = new ArrayList<Integer>();
        int N = a.size();
        for (int k = 0; k < N; k++) {
            for (int i = 0; i < N - k; i++) {
                int j = i + k;
                B.add(max(a, i, j));
            }
        }
        return B;
    }

    private static List<Integer> getSOf(int[] a){
        List<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(max(a, i, j));
            }
        }
        return B;
    }

    private static int max(List<Integer> a, int i, int j) {
        int max = a.get(j);
        for (int k = i; k < j; k++) {
            if (a.get(k) > max) {
                max = a.get(k);
            }
        }
        return max;
    }

    private static int max(int[] a, int i, int j) {
        int max = a[j];
        for (int k = i; k < j; k++) {
            if (a[k] > max) {
                max = a[k];
            }
        }
        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();
    }
}