#!/bin/python

import sys
def alpha(A, n):
    B = []
    for k in range(0, n):
        for i in range(0, n-k):
            j = i + k
            mx = max(A[i:j+1])
            #print(A[i:j+1], mx)
            B.append(mx)
    #print(B)
    return B

def solve(A, n):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    A = alpha(A, n)
    A = alpha(A, len(A))
    #print(A)
    return sum(A)%1000000007

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