#!/bin/python

import sys

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    B = [];
    s = 0;
    j = 0;
    #print A[0];
    for n in range(2):
        B = [];
        for k in range(len(A) ):
            arr = [];
            for i in range(len(A) - k ):
                arr = [];
                j = i + k;
                #print i;
                #print j;
                if(i==j):
                    arr.append(A[i]);
                else:
                    arr = A[i:j+1];
                #print arr;
                #print len(arr);        
                if(len(arr) == 1):
                    B.extend(arr);
                else:
                    B.append(max(arr));
                #print B;
        A = B;
        #print "check" 
        #print A;
        
    for i in range(len(B)):
        s = s + B[i];
    #print s; 
    return (s%(1000000007));

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(int, raw_input().strip().split(' '))
    result = solve(a)
    print result