#!/bin/python3

import sys

def solve(A):
    b=[];
    j=0;
    for k in range(len(A)):
        for i in range(len(A)-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(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result1 = (solve(a))
    result= sum(solve(result1))
    print(result)