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 sum of S(S(A)) modulo 10^9+7.
        //making s(a)
        int n=a.length,t,l,i,k,j,s,e;
        long an=0;
        l=n*(n+1)/2;
        int sa[]=new int[l];
        for(i=0;i<n;i++){
            sa[i]=a[i];
            an+=sa[i];
        }
        s=0;e=n;t=0;
        while(t++<n){
            for(i=0;i<n-t;i++){
                sa[e+i]=Math.max(sa[s+i],sa[s+1+i]);
                an+=sa[e+i];
            }
            s=e;
            e+=(n-t);
        }
     /*   
     for(i=0;i<l;i++){
            System.out.print(sa[i]+" ");
        }
        */
        t=0;
        while(t++<l){
            for(i=0;i<l-t;i++){
                sa[i]=Math.max(sa[i],sa[i+1]);
                an+=sa[i];
            }
        }
        return (int)an%1000000007;
    }

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