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

public class Solution {

    static int max(int[] A,int i,int j)
    {
        int max=0;
        for(int k=i;k<=j;k++)
        {
            if(max<A[k])
                max=A[k];
        }
        return max;
    }
    
    static int[] a(int[] A)
    {
        int[] B=new int[((A.length*(A.length+1))/2)];
        int ind=0;
        for(ind=0;ind<A.length;ind++)
        {
            B[ind]=A[ind];
        }
        int j;
        for(int k=1;k<A.length;k++)
        {
            for(int i=0;i<A.length-k;i++)
            {
                j=i+k;
                B[ind++]=max(A,i,j);   
            }
        }
        return B;
    }
    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        A=a(A);
        A=a(A);
        int sum=0;
        for(int i=0;i<A.length;i++)
        {
            sum=(int)((long)sum%1000000007+(long)A[i]%1000000007)%100000007;            
        }
        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();
    }
}