import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int solve(int[] A) {
        
        int[] step1 = smax(A);
        //System.out.println(Arrays.toString(step1));
        int[] step2 = smax(step1);
        //System.out.println(Arrays.toString(step2));
        
        return Arrays.stream(step2).sum();
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
    }

    static int[] smax(int[] A){
        int[] ret = new int[A.length*(A.length+1)/2];
        int r = 0;
        for(int k = 0; k < A.length; k++){
            for(int i =0; i < A.length-k; i++){
                int j = i + k;
                int max = A[j];
                for(int x = i; x < j; x++){
                    if (A[x] > max)
                        max = A[x];
                }
                ret[r++] = max;
            }
        }
        return ret;
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = solve(a);
        System.out.println(result);
        in.close();
    }
}