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())
arr=list(map(int,input().split()))
pse,nse=[-1]*n,[n]*n
stack,stack2=[0],[n-1]
for i in range(1,n):
    while(len(stack) and arr[i]<arr[stack[-1]]):
        nse[stack.pop()]=i
    stack.append(i)
    
    while(len(stack2) and arr[n-i-1]<arr[stack2[-1]]):
        pse[stack2.pop()]=n-i-1
    stack2.append(n-i-1)
 
dic={}
for i in range(n):
    dic[arr[i]]=max(dic.get(arr[i],0),(nse[i]-pse[i]-1))    
out=[0]*(n+1)
for i in dic:
    out[dic[i]]=max(out[dic[i]],i)
temp=out[-1]
for i in range(n-1,0,-1):
    if out[i]<out[i+1]:
        out[i]=out[i+1]
print((" ").join(map(str,out[1:])))
