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.
n = int(input())
maxn = n+10
dpl , dpr , ans = [0]*maxn , [n+1]*maxn , [0]*maxn
a = [0]
a.extend(list(map(int,input().split())))
a.append(0)

for i in range(1,n+1):
    tmp = i-1
    while(a[tmp] >= a[i]):
        tmp = dpl[tmp]
    dpl[i] = tmp

for i in range(n,0,-1):
    tmp = i+1
    while(a[tmp] >= a[i]):
        tmp = dpr[tmp]
    dpr[i] = tmp
    ans[dpr[i]-dpl[i]-1] = max(ans[dpr[i]-dpl[i]-1],a[i])

for i in range(n,0,-1):
    ans[i] = max(ans[i+1],ans[i])

Ans = ''
for i in range(1,n+1):
    Ans += str(ans[i])
    if(i < n):
        Ans += ' '
print(Ans)
