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 sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write


def in_num():
    return int(raw_input())


def in_arr():
    return list(map(int,raw_input().split()))


def pr_num(n):
    stdout.write(str(n)+'\n')


def pr_arr(arr):
    pr(' '.join(map(str,arr))+'\n')
def check(l,n,x,key):
    c=0
    for i in xrange(n):
        if key<=l[i]:
            c+=1
        else:
            c=0
        if c>=x:
            return 1
    return 0
xrange=range
n=in_num()
l=in_arr()#map(int,raw_input().split())
mn=10000000000000000000
mx=0
for i in l:
    mn=min(mn,i)
    mx=max(mx,i)

ans = [0]*n
for i in xrange(n):
    l1,r1=mn,mx
    if l1==r1:
        ans[i]=l1
        continue
    
    while l1<=r1:
        mid= (l1+r1)//2
        if check(l,n,i+1,mid):
            ans[i]=mid
            l1=mid+1
        else:
            r1=mid-1
pr_arr(ans)
        
