#!/bin/python3

import sys

def solve(A):
    B = transform(transform(A))
    ret = sum(B)
    return ret

def transform(A):
    lenA = len(A)
    B = []
    for k in range(lenA):
        for i in range(lenA - k):
            j = i + k
            max_t = max_tr(A,i,j)
            B.append(max_t)
    return B
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.

def max_tr(A, sta, fin):
    #print(sta,fin)
    max = -99
    for c in range(sta,fin+1):
        #print(c)
        if A[c] > max:
            max = A[c]
    return max        
    
if __name__ == "__main__":
    n = int(input().strip())
    A = list(map(int, input().strip().split(' ')))
    result = solve(A)
    print(result)