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()))
stack=[]
left=[0 for i in range(n)]
right=[0 for i in range(n)]
for i in range(n):
    while stack and arr[i] < arr[stack[-1]]:
        stack.pop()
    left[i]=i-stack[-1]-1 if stack else i
    stack.append(i)
stack=[]
for i in range(n-1,-1,-1):
    while stack and arr[i] < arr[stack[-1]]:
        stack.pop()
    right[i]=stack[-1] -i if stack else n-i
    stack.append(i)
ans=[0 for i in range(n+1)]
for i in range(n):
    ans[left[i]+right[i]]=max(ans[left[i]+right[i]],arr[i])
for i in range(n-1,0,-1):
    ans[i]=max(ans[i],ans[i+1])
mini=9999999999999
for i in range(1,n+1):
    if ans[i]==0:
        print(mini,end=' ')
    else:
        print(ans[i],end=' ')
        mini=ans[i]
print()