#!/bin/python3

import sys
def maximum(l):
    max_num=l[0]
    for i in l:
        if i>=max_num:
            max_num=i
    return max_num
def max_transform(a):
    b=[]
    for k in range(len(a)):
        for i in range(len(a)-k):
            j=i+k
            b.append(maximum(a[i:j+1]))
    return b     
def solve(A):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    sum=0
    for i in A:
        sum+=i
    return sum

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