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
ip=sys.stdin.readline
n = int(ip())
arr = list(map(int, ip().split()))
seq = [0 for _ in range(n)]
stack = [n - 1]
p1 = n - 2
while p1 >= 0:
    while stack and arr[p1] < arr[stack[len(stack)-1]]:
        seq[stack[len(stack)-1]] = stack[len(stack)-1] - p1
        stack.pop(len(stack)-1)
    stack.append(p1)
    p1 -= 1
while stack:
    seq[stack[len(stack)-1]] = stack[len(stack)-1] + 1
    stack.pop(len(stack)-1)

stack = [0]
p1 = 1
while p1 < n:
    while stack and arr[p1] < arr[stack[len(stack)-1]]:
        seq[stack[len(stack)-1]] += p1 - stack[len(stack)-1]
        stack.pop(len(stack)-1)
    stack.append(p1)
    p1 += 1
while stack:
    seq[stack[0]] += n - stack[0]
    stack.pop(0)
#print(seq)
ans=[[0,0] for _ in range(n+1)]
for i in range(n):
    seq_length=seq[i]-1
    if ans[seq_length][1]<arr[i]:ans[seq_length][1]=arr[i]
ele=-1
for i in range(n,0,-1):
    if ans[i][1]>ele:
        ele=ans[i][1]
    else:
        ans[i][1]=ele
for i in range(1,n+1):
    print(ans[i][1],sep="",end=" ")
print()