#!/bin/python

import sys

def S(A):
	B = []
	for k in range(len(A)):
		for i in range(len(A)-k):
			j = i+k
			B.append( max(A[i:j+1]) )
	return B

def solve(A):
	#  Return the sum of S(S(A)) modulo 10^9+7.
	theSum = sum(S(S(A)))
	return theSum % ((10**9)+7)

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