#!/bin/python3

import sys

M = 10**9 + 7

def S(A):
    for k in range(len(A)):
        for i in range(len(A)-k):
            j = i + k
            yield max(A[i:j+1])

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    S1 = list(S(A))
    res = 0
    for v in S(S1):
        res = (res + v) % M
    return res

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