#!/bin/python3

import sys

def maxi(A,i,j):
	maax=A[i]
	for k in range (i,j+1):
		if (A[k]>=maax):
			maax=A[k]
	
	return maax
def maxtra(A):
	B=list()
	for k in range(0,len(A)):
		for i in range(0,len(A)-k):
			j=i+k
			B.append(maxi(A,i,j))
			
	return B
				
def solve(A):
    A=maxtra(A)
    A=maxtra(A)
    ans=0
    for i in range(0,len(A)):
		ans+=A[i]
    return ans % (pow(10,9)+7)
    
    #  Return the sum of S(S(A)) modulo 10^9+7.

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