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.
        

        ArrayList<Integer> B = new ArrayList<Integer>();
        int j;

        for(int k = 0; k < A.length; k++) {
            for (int i = 0; i < A.length - k; i++) {
                j = i + k;
                int[] aSub = Arrays.copyOfRange(A, i, j + 1);
                int max = 0;
                for (int p = 0; p < aSub.length; p++) {
                    if (aSub[p] > max) max = aSub[p];
                }
                B.add(max);
            }
        }
        //System.out.println(B.toString());
        
        ArrayList<Integer> C = new ArrayList<Integer>();
        for(int k = 0; k < B.size(); k++) {
            for (int i = 0; i < B.size() - k; i++) {
                j = i + k;
                List<Integer> bSub = B.subList(i, j + 1);
                int max = 0;
                for (int p = 0; p < bSub.size(); p++) {
                    if (bSub.get(p) > max) max = bSub.get(p);
                }
                C.add(max);
            }
        }
        //System.out.println(C.toString());
        
        int result = sum(C);
        double cap = Math.pow(10, 9) + 7;
        return (int)(result % cap);
    }

    static int sum(ArrayList<Integer> list) {
        int sum = 0;
        for (int i = 0; i < list.size(); i++) {
            sum += list.get(i);
        }
        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();
    }
}