#!/bin/python3

import sys


def S(A):
    B = []
    for k in range(0,len(A)):        
        for i in range(0,len(A)-k):            
            j = i + k
            B.append(max([x for x in A[i:j+1]]))            
    #print(B)
    return B
    
def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    s1 = S(A)
    s2 = S(s1)
    return sum(s2)       


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