#!/bin/python3

import sys

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    B=[]
    for k in range(len(A)):
        for i in range(len(A)-k):
            j=i+k+1
            B.append(max(A[i:j]))
        
    
    C=[]
    c1=0
    for k in range(len(B)):
        for i in range(len(B)-k):
            j=i+k+1
            c1=(c1+max(B[i:j]))%1000000007
            C.append(max(B[i:j]))
        
    
    return c1

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