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().strip())
a=list(map(int,input().strip().split()))

ans=[0]*(n+1)

#labirentin cevresine attigim 0lar gibi indexOut yememek icin
a=[0]+a+[0]
s=[]

for index,value in enumerate(a):
    #print('SS -> ',s)
    #print('ANS -> ',ans,'\n')
    #buyuk oldukca devam et 
    while s and value<s[-1][0]:
        ans[index-s[-2][1]-1]=max(s[-1][0],ans[index-s[-2][1]-1])
        s.pop()
    s.append((value,index))

#print('SS -> ', s)
#print('ANSS----',ans)

ans=ans[::-1]
for i in range(n):
    ans[i+1]=max(ans[i+1],ans[i])
ans=ans[::-1]
print(' '.join(map(str,ans[1:])))




"""

10
1 2 3 4 5 4 3 2 1 6

3
524125987 923264237 374288891

"""