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

public class Solution {
       static int[] getS(int A[]){
           int n=A.length,i,j,k=0;
           int m=n*(n+1)/2;
           int B[]=new int[m];
           /*
           for(i=0;i<n;++i)
               B[i]=A[i];
           */
           for(i=0;i<n;++i)
               for(j=0;j<n-i;++j)
               {
                   int t=i+j+1,l=A[j];
                   for(int c=j+1;c<t;++c)
                       if(l<A[c])
                           l=A[c];
                   B[k++]=l;
               }
           /*for(i=0;i<m;++i)
               System.out.print(B[i]);
           System.out.print("\n");
           */
           return B;
       }
    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        A = getS(getS(A));
        int sum = 0;
        for(int i=0;i<A.length;++i){
            sum+=A[i];
            if(sum>1000000007)
                sum%=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();
    }
}