#!/bin/python3

import sys

def S(A):
    size_A = len(A)
    B = []
    for k in range(size_A):
        
        for i in range(size_A-k):
            j = i + k
            
            max_value = max(A[i:j+1])
            
            B.append(max_value)
            #print("k {} i {} j {} max {} A {}".format(k, i, j, max_value, B))
    #print(B)
    return B

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

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