#!/bin/python

import sys

def solve(n,A):
    B=[]
    for k in range(n):
        for i in range(n-k):
            j=i+k
            B.append(max(A[i:j+1]))
    return B
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.

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