#!/bin/python3

import sys

def solve(A):
    l=10**9+7
    C = []
    B = []
    for k in range(len(A)):
        for i in range(len(A)-k):
            j = k+i
            B.append(max(A[i:j+1])%l)
    for k in range(len(B)):
        for i in range(len(B)-k):
            j = k+i
            C.append(max(B[i:j+1])%l)
    s=0
    for x in range(len(C)):
        s+=C[x]
        s = s%l
    return s        
    
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.

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