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 mod = 1000000007;
        int ls = (a.length * (a.length + 1))/2;
        int[] s = new int[ls];
        int lss = (ls * (ls + 1))/2;
        int[] ss = new int[lss];
        
        int addIndex = 0;
        for (int k = 0; k < a.length; k++){
            for (int i = 0; i < a.length - k; i++){
                int j = i + k;
                int max = 0;
                for (int m = i; m < j+1; m++){
                    int test = a[m];
                    if (test > max){
                        max = test;
                    }
                }
                s[addIndex] = max;
                addIndex++;
            }
        }
        addIndex = 0;
        for (int k = 0; k < ls; k++){
            for (int i = 0; i < ls - k; i++){
                int j = i + k;
                int max = 0;
                for (int m = i; m < j+1; m++){
                    int test = s[m];
                    if (test > max){
                        max = test;
                    }
                }
                ss[addIndex] = max;
                addIndex++;
            }
        }
        
        int total = 0;
        for (int i = 0; i < lss; i++){
            total = (total + ss[i])%mod;
        }
        //System.out.println(Arrays.toString(s));
        //System.out.println(Arrays.toString(ss));
        return total;
    }

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