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

public class Solution {
    static int modd = 1000000007;
    static int[] solve(int[] A) {
        long total = 0;
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        List<Integer> numbers = new ArrayList<>();
        List<Integer> temp = new ArrayList<>();        
        List<Integer> partial = new ArrayList<>();
        
        for(int idx=0;idx<A.length;idx++){
            temp.add(A[idx]);
        }
        for(int k=0;k<A.length;k++){
            for(int i=0;i<A.length-k;i++){
                int j = i + k;
                partial = temp.subList(i,j+1);
                numbers.add(Collections.max(partial));
            } 
        }
        
        
        for(int idx=0;idx<numbers.size();idx++){
            total+=numbers.get(idx);
        }
        
        return numbers.stream().mapToInt(Integer::intValue).toArray();
    }

    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(solve(a));
        long sum = 0;
        for(int idx=0;idx<result.length;idx++){
            //System.out.println(result[idx]);
            sum = (sum+result[idx])%modd;
        }
        System.out.println(sum);
        in.close();
    }
}