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.
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
l=[-1]*n
r=[n]*n
stack=[]
for i in range(n):
  while stack and a[stack[-1]]>=a[i]:
    stack.pop()
  if stack:
    l[i]=stack[-1]
  stack.append(i)
stack=[]
for i in range(n)[::-1]:
  while stack and a[stack[-1]]>=a[i]:
    stack.pop()
  if stack:
    r[i]=stack[-1]
  stack.append(i)
ans=[min(a)]*n
for i in range(n):
  d=r[i]-l[i]-2
  ans[d]=max(ans[d],a[i])
val=min(a)
for i in range(n)[::-1]:
  val=max(val,ans[i])
  ans[i]=val
print(*ans)