#!/bin/python3

import sys

def S(a):
    B = []
    n = len(a)
    for k in range(n):
        for i in range(n - k):
            j = i + k
            z = max(a[i:(j+1)])
            B.append(z)
    return B

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    sa = S(A)
    ssa = S(sa)
    result = sum(ssa) 
    return result % (10**9 + 7)

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