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

public class Solution {

    static int solve(int[] a, int n) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        int hh = 1000000007, n1 = n*(n+1)/2;
        int[] ssa = new int[n1*(n1+1)/2];
        
        for(int i = 0; i<n; i++)
            ssa[i] = a[i];
        
        int st_p = 0;
        for(int i = 1; i<n; i++){
            int st = st_p + n - i + 1; 
            for(int j = 0; j<n-i; j++){
                ssa[st + j] = ssa[st_p + j]>ssa[st_p + j + 1]?ssa[st_p + j] : ssa[st_p + j + 1]; 
            }
            st_p = st;
        }
        st_p = 0;
        for(int i = 1; i<n1; i++){
            int st = st_p + n1 - i + 1; 
            for(int j = 0; j<n1-i; j++){
                ssa[st + j] = ssa[st_p + j]>ssa[st_p + j + 1]?ssa[st_p + j] : ssa[st_p + j + 1]; 
            }
            st_p = st;
        }
        int sum = 0;
        for(int i = 0; i<n1*(n1+1)/2; i++)
            sum = (sum + ssa[i])%hh;
        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, n);
        System.out.println(result);
        in.close();
    }
}