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.
        int sum=0; 
            ArrayList<Integer> B=new ArrayList<>();
        ArrayList<Integer> C=new ArrayList<>();
        for(int k=0;k<A.length;k++)
        {
            for(int i=0;i<A.length-k;i++)
            {
                B.add(solveMax(i,i+k,A));
            }
        }
       // Integer []CA=new Integer[B.size()];
        //CA=B.toArray(CA);
       int []CA= B.stream().mapToInt(i -> i).toArray();
       // int[] CA = (int[])B.toArray(int[B.size()]);
        for(int k=0;k<B.size();k++)
        {
            for(int i=0;i<B.size()-k;i++)
            {
                C.add(solveMax(i,i+k,CA));
            }
        }
        for(int i:C)
            sum+=i;
       // System.out.print(C);
        return sum%(10*10*10*10*10*10*10*10*10+7);
    }
public static int solveMax(int i, int j,int[] A )
{
    int max=0;
    for(;i<=j;i++)
    {
        if(max<A[i])
            max=A[i];
    }
    return max;
}
    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();
    }
}