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

public class Solution {

    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.

        int[] s1 = maxTransform(A);
        int[] s2 = maxTransform(s1);

        int sum = 0;
        for (int each : s2) {
            sum += each;
        }

        return sum;
    }

    private static int[] maxTransform(int[] A) {
        List<Integer> B = new ArrayList<>();

        for (int k = 0; k < A.length; k++) {
            for (int i = 0; i < A.length - k; i++) {
                int j = i + k;
                int max = max(A, i, j);
                B.add(max);
            }
        }

        return toIntArray(B);
    }

    private static int max(int[] A, int i, int j) {
        int max = A[i];
        for ( ; i <= j; i++) {
            max = A[i] > max ? A[i] : max;
        }
        return max;
    }

    private static int[] toIntArray(List<Integer> b) {
        int[] result = new int[b.size()];
        for (int i = 0; i < b.size(); i++) {
            result[i] = b.get(i);
        }
        return result;
    }

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