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.
def NextSmallIndex(arr,n):
    nse=[n]*n
    stack=[0]
    for i in range(1,n):
        while(stack and arr[stack[-1]]>arr[i]):
            nse[stack.pop()]=i
        stack.append(i)
    return nse
        
def FirstSmallIndexLast(arr,n):
    fse=[-1]*n
    stack=[n-1]
    for i in range(n-2,-1,-1):
        while(stack and arr[stack[-1]]>arr[i]):
            fse[stack.pop()]=i
        stack.append(i)
    return fse
    
    
n=int(input())
arr=list(map(int,input().split()))
nse=NextSmallIndex(arr,len(arr))
fse=FirstSmallIndexLast(arr,len(arr))

ans=[0]*(n+1)
for i in range(n):
    ans[nse[i]-fse[i]-1]=max(ans[nse[i]-fse[i]-1],arr[i])
for i in range(n-1,0,-1):
    ans[i]=max(ans[i],ans[i+1])

print(*ans[1:])
    
# 10
# 1 2 3 4 5 4 3 2 1 6

    
    
