#!/bin/python3

import sys
def solve(A):
        b=[]
        for k in range(0,len(A)):
            c=[]
            for i in range(0,len(A)-k):
                j=i+k
                c=A[i:j+1]
                b.append(max(c))
        return(b)
    

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(solve(a))
    r=sum(result)
    if(r>1000000000):
        r=(r%1000000000)+7
    print(r)