#!/bin/python

import sys
s=0
def solve(a):
    b=[]
    for k in range(0,len(a)):
        for i in range(0,len(a)-k):
            j=i+k
            max=0
            for l in range(i,j+1):
                if(a[l]>max):
                    max=a[l]
            b.append(max)
    return b

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(int, raw_input().strip().split(' '))
    result = solve(a)
    result=solve(result)
    for i in result:
        s+=i    
    print s