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

public class Solution {

    static int[] T(int[] list) {

        int size = (list.length*(list.length+1))/2;
        int[] arr = new int[size];
        int filed =0;
        for(int i=0;i<list.length;i++){
            int max = Integer.MIN_VALUE;
            for(int j=list.length-i-1;j>=0;j--){
                max = Math.max(list[j],max);
                arr[filed+j] = max;
            }
            filed = filed + list.length-i;
        }




        return arr;


    }
    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        int sum = 0;
        List<Integer> list = new ArrayList<>();
        for(int i=0;i<A.length;i++){
            list.add(A[i]);
        }

        int[] arr = T(T(A));

        int mod = (int)Math.pow(10,9)+7;
        for(int i=0;i<arr.length;i++){
            sum = (sum + arr[i])%mod;
        }

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