#!/bin/python3

import sys
def solve(A):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    A=maxer(A)
    D=maxer(A)
    return sum(D)
    pass
def maxer(B):
    C=[]
    for k in range(len(B)):
        for i in range(len(B)-k):
            j=i+k
            someval = max(B[i:j+1])
            C.append(someval)
    return C

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