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

public class Solution {

    static int max(int[] A, int from, int to) {
        int max = Integer.MIN_VALUE;
        for (int i=from; i<=to; i++){
            if (A[i]>max){
                max = A[i];                   
            }
        }
        return max;
        
    }
    static int[] transform(int[] A){
        int len = A.length;
        int j = 0;
        List<Integer> B = new ArrayList<>();
        for (int k = 0; k<=len-1;k++){
            for (int i=0; i<=len-k-1;i++){
                j = i+k;
                B.add(max(A,i,j));
            }
        }
        return B.stream().mapToInt(i->i).toArray();
    }
    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        int[] B = transform(A);
        int[] C = transform(B);
        return Arrays.stream(C).reduce(0,Integer::sum);
    }

    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();
    }
}