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()))
arr=[0]+arr+[0]
suffmin=[n+1]*(n+2)
premin=[0]*(n+1)
st=[n+1]
for i in range(1,n+1):
  while arr[i]<arr[st[-1]]:
    suffmin[st[-1]]=i
    st.pop()
  st+=[i]
st=[0]
for i in range(n,0,-1):
 while arr[i]<arr[st[-1]]:
   premin[st[-1]]=i
   st.pop()
 st+=[i]
maxans=[0]*(n+2)
for i in range(1,n+1):
 if maxans[suffmin[i]-premin[i]-1]<arr[i]:
   maxans[suffmin[i]-premin[i]-1]=arr[i]
m=arr[1]
for i in range(1,n+1):
 if arr[i]<m:
    m=arr[i]
maxans[n]=m
for i in range(n-1,0,-1):
  if maxans[i+1]>maxans[i]:
   maxans[i]=maxans[i+1]

print(*maxans[1:n+1])
