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.
from re import A
import sys
ip=sys.stdin.readline
n = int(ip())
arr = list(map(int, ip().split()))
op=min(arr)
for i in range(n):arr[i]=arr[i]-op+1
seq = dict()
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)
    


max_cnt=dict()
for i in range(n):
    if arr[i] not in max_cnt:max_cnt[arr[i]]=seq[i]
    else:max_cnt[arr[i]]=max(max_cnt[arr[i]],seq[i])
tot_count=0
for i in range(2*(10**5),0,-1):
    if tot_count==n:break
    if i in  max_cnt:
        cnt=max_cnt[i]
        cnt=max(0,cnt-tot_count-1)
        for _ in range(cnt):print(i+op-1,sep="",end=" ")
        tot_count+=cnt
print()