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

public class Solution {
    
private static int[][] findMaxMatrix(int[] a) {

    int n = a.length;

    int[][] m = new int[n][n];

    for (int i=0; i<n; ++i) {

            m[i][i] = a[i];

            int max = a[i];

            for (int j=i+1; j<n; ++j) {

                        if (a[j] > max) {

                                    max = a[j];

                        }

                        m[i][j] = max;

            }

    }
    return m;
}

    private static int[] buildB(int[] a) {
        int[][] m = findMaxMatrix(a);
        int n = a.length;
        int[] b = new int[(n * (n+1) / 2)];
        
        int b_i = 0;
        for (int k=0; k<n; ++k) {
            int end = n-k;
            for (int i=0; i<end; ++i) {
                int j = i+k;
                b[b_i++] = m[i][j];
            }
        }
        return b;
    }
    static int solve(int[] a) {
       int[] b = buildB(buildB(a));
        
       int sum = 0;
       for (int x: b) {
           sum = ((sum + x) % 1000000007);
       }
       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();
    }
}