#!/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
            if i == j:
                B.append(A[j])
            else:
                B.append(max(A[i:j+1]))
                
    C = []
    for k in range(len(B)):
        for i in range(len(B) - k):
            j = i + k
            if i == j:
                C.append(B[j])
            else:
                C.append(max(B[i:j+1]))
    return sum(C) % ((10 ** 9) + 7)
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(a)
    print(result)