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 length of the longest possible sequence of moves modulo 10^9+7.
        int j = 0;
        Vector b = new Vector<Integer>();
        int c = 0;
        for(int k = 0; k < A.length; k++){
            for (int i = 0; i < A.length-k; i++){
                j = i+k;
                b.addElement(max(A, i, j));
                //System.out.print(max(A,i,j)+" ");
            }
        }
        for(int k = 0; k < b.size(); k++){
            for (int i = 0; i < b.size()-k; i++){
                j = i+k;
                c+=max(b, i, j);
            }
        }
        return c % (int)(Math.pow(10,9)+7);
    }
    static int max(int[] arr, int start, int end){
        int m = 0;
        for (int i = start; i <= end; i++){
            if(arr[i]>m){
                m=arr[i];
            }
        }
        return m;
    }
    static int max(Vector<Integer> arr, int start, int end){
        int m = 0;
        for (int i = start; i <= end; i++){
            if(arr.get(i)>m){
                m=arr.get(i);
            }
        }
        return m;
    }

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