#!/bin/python3

import sys

def solve(A):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    b=[]
    for k in range(len(a)):
        for i in range(len(a)-k):
            j=i+k
            b.append(max(a[i:j+1]))
    c=[]
    for k in range(len(b)):
        for i in range(len(b)-k):
            j=i+k
            c.append(max(b[i:j+1]))
    return sum(c)
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(a)
    print(result)