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

public class Solution {

  static int[] maxTransform(int[] A) {
        int j;
        int ind=0;
        int[] B=new int[A.length*(A.length+1)/2];
        int[][] maximums = new int[A.length][A.length];
        for (int k = 0; k < A.length; k++) {
            for (int i = 0; i < A.length - k; i++) {
                j = i + k;
                int maximum;
                if (i == j) {
                    if (A[i] >= A[j]) {
                        maximum = A[i];
                    } else {
                        maximum = A[j];
                    }
                } else {
                    if (maximums[i][j - 1] >= maximums[j][j]) {
                        maximum = maximums[i][j - 1];
                    } else {
                        maximum = maximums[j][j];
                    }
                }
                maximums[i][j] = maximum;
                B[ind++]=maximum;
            }
        }
        return B;
    }

    static int solve(int[] A) {
        int[] maxTransformArray=maxTransform(maxTransform(A));
        int sum=0;
        for(int i=0;i<maxTransformArray.length;i++){
            sum+=maxTransformArray[i];
        }
        return 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();
    }
}