#!/bin/python3

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


def solve(A):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    return sum(solveA(solveA(A)))%(10**9+7)
if __name__ == "__main__":
    n = int(input().strip())
    A = list(map(int, input().strip().split(' ')))
    result = solve(A)
    print(result)