#!/bin/python3

import sys

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

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