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[] b=new int[100000];
        int incr=0,incr2=0;
        for(int k=0;k<=A.length-1;k++)
        {
            for(int i=0;i<=A.length-k-1;i++)
            {
                int j=i+k,incr1=0;
                int[] c=new int[100000];
                for(int x=i;x<=j;x++)                    
                    c[incr1++]=A[x];
                Arrays.sort(c);
                b[incr2++]=c[c.length-1];
                
            }
        }
        for(int i=0;i<100000&&b[i]!=0;i++)
        {
            System.out.print(" "+b[i]);
        }
        return 2;
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }

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