#!/bin/python3

import sys

def find(x):
    l=[]
    lmain=[]
    for k in range(len(x)):
        for i in range(len(x)-k):
            j=i+k
            l.append((i,j))
    for i in l:
        ltemp=[]
        for j in range(i[0],i[1]+1):
            ltemp.append(x[j])
        ltemp.sort()
        lmain.append(ltemp[-1])
    return lmain

def solve(y):
    sum=0
    y=find(find(y))
    for i in y:
        sum+=i
    return sum
    #  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(' ')))
    result = solve(a)
    print(result)