#!/bin/python3

import sys

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

    return b

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    B = S(S(A))
    return sum(B)
           

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