Mike is the president of country What-The-Fatherland. There are *n* bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to *n* from left to right. *i*-th bear is exactly *a*<sub class="lower-index">*i*</sub> feet high. 

A group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strength of a group is the minimum height of the bear in that group.

Mike is a curious to know for each *x* such that 1 ≤ *x* ≤ *n* the maximum strength among all groups of size *x*.
The first line of input contains integer *n* (1 ≤ *n* ≤ 2 × 10<sup class="upper-index">5</sup>), the number of bears.

The second line contains *n* integers separated by space, *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>), heights of bears.
from io import StringIO

import sys
data = sys.stdin

def next_val(mapping=int):
    return mapping(data.readline().strip())

def next_array(mapping=int):
    return map(mapping, data.readline().split(' '))

num = next_val()
bears = list(next_array())


dp = bears

strs = [max(dp)]

for i in range(num-1):
    rv = []
    max_strength = 0
    for idx in range(len(dp)-1):
        strength = min(dp[idx], dp[idx+1])
        max_strength = max(strength, max_strength)
        rv.append(strength)
    dp = rv
    strs.append(max_strength)
    
print(' '.join(map(str, strs)))

    
