#!/bin/python3

import sys
def solve(A,i=[0]):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    B=[]    
    for k in range(len(A)):
        for i in range(len(A)-k):
            j=i+k
            B.append(max(A[i:j+1]))
    i=i+1        
    if i==1:
        return B
    if i==2:
        return sum(B)

if __name__ == "__main__":
    n = int(input().strip())
    A = list(map(int, input().strip().split(' ')))
    result1 = solve(A,0)
    result2=solve(result1,1)
    print(sum(result2))