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

public class Solution {

 static Max getMax(Integer[] a) {
        Max max = new Max();
        max.max = new int[a.length][a.length];
        max.nos = a.length + ((a.length - 1) * (a.length) / 2);
        max.a = new Integer[max.nos];
        for (int i = 0; i < a.length; i++) {
            max.max[i][i] = a[i];
            for (int j = 0; j < i; j++) {
                max.max[j][i] = Math.max(a[i], max.max[j][i - 1]);
            }
        }

        int index = 0;
        for (int k = 0; k < a.length; k++) {
            for (int i = 0; i < (a.length - k); i++) {
                int j = i + k;
                max.sum = max.sum + max.max[i][j];
                max.a[index++] = max.max[i][j];
            }
        }

        return max;
    }

    static class Max {
        Integer[] a;
        int[][] max;
        int sum;
        int nos;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Integer[] a = new Integer[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = getMax(getMax(a).a).sum;
        System.out.println(result);
        in.close();
    }
}