def solve(A):
  b = []
  for k in range(len(A)):
    for i in range(len(A)-k):
      j = i+k
      b.append(max(A[i:j+1]))
  
  return(b)


n = int(input())
a = list(int(s) for s in input().split())
result = sum(solve(solve(a)))
print(result)