#!/usr/bin/env pypy
from __future__ import print_function


def sop(a):
    res = []
    for k in range(0, len(a)):
        for i in range(0, len(a) - k):
            j = k + i
            res.append(max(a[i:j+1]))
    return res


def solve(a):
    return sum(sop(sop(a)))


if __name__ == '__main__':
    import fileinput
    input = fileinput.input()

    n = int(input.readline().strip())
    a = map(int, input.readline().split())

    print(solve(a))