#!/bin/python3

import sys

def solve(A):
    b=[]
    b.extend(A)
   
    l=[]
    for k in range(1,len(A)):
        c=list(range(0,len(A)-k))
     #   print(c)
        list(map(lambda x :b.append(max(A[x:x+k+1]))   ,c))
   
   # print(b)
    for j in range( 1,len(b)):
        
        d=list(range(0,len(b)-j))
       # print(d,j)
        list(map(lambda x :l.append(max(b[x:x+j+1]))   ,d))
    return sum(b+l)
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(a)
    print(result)