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

public class Solution {

    
    static LinkedList<Integer> list;
    
    static long solve(int[] A) {
       long sum=0;
       max(A);
       int[] second= new int[list.size()];
       for(int t1=0;t1<list.size();t1++){
           second[t1]=list.get(t1);
           
       }
       
       list.clear();
       max(second);      
       
       for(int s:list){
           sum=sum+s;
       }
      
       return (sum%(1000000000+7));
        
    }
    
    
    
    
    static void max(int[] arr){
        for(int k=0;k<arr.length;k++){
            for(int i=0;i<(arr.length)-k;i++){
                int j=i+k;
                if(j>i){
                    int[] newarr=new int[j-i+1];
                    for(int temp=i;temp<=j;temp++){
                        newarr[temp]=arr[temp];
                    }
                    max(newarr);
                }
                if(i==j){
                    list.add(arr[i]);
                }
            }
        }
    }
    
    
    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();
        }
        list=new LinkedList<Integer>();
        long result = solve(a);
        System.out.println(result);
        in.close();
    }
}