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())
s=list(map(int,input().split()))
output=[len(s)]*len(s)
stack=[]
stack.append(0)
for i in range(1,len(s)):
    if stack and s[stack[-1]]<=s[i]:
        stack.append(i)
    else:
        while stack and s[stack[-1]]>s[i]:
            output[stack[-1]]=i 
            stack.pop()
        stack.append(i)
output1=[-1]*len(s)
stack=[]
stack.append(len(s)-1)
for i in range(len(s)-2,-1,-1):
    if stack and s[stack[-1]]<=s[i]:
        stack.append(i)
    else:
        while stack and s[stack[-1]]>s[i]:
            output1[stack[-1]]=i 
            stack.pop()
        stack.append(i)
res=[0]*(len(s)+1)
for i in range(len(s)):
    res[output[i]-output1[i]-1]=max(res[output[i]-output1[i]-1],s[i])
for i in range(len(res)-2,-1,-1):
    res[i]=max(res[i],res[i+1])
print(*res[1:])