#!/bin/python3

import sys

def solve(n,a):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    lst = []
    for k in range(n):
        for i in range(n-k):
            j=i+k
            max = a[i]
            for m in range(i,j+1):
                if a[m]>max:max=a[m]
            lst.append(max)
    return lst
    
         
            

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    lst = solve(n,a)
    lst = solve(len(lst),lst)
    sum = 0
    for i in lst:
        sum+= i
    print(sum)