#!/bin/python3

MOD=1000000007
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(0, len(a) - k):
            j = i + k
            B.append(max(a[i:j + 1]))


    return B

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

    print(sum(result)% MOD)