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 math
n=int(input())
a=list(map(int,input().split()))
t=int(math.log2(n))
l=[[i]+[0]*t for i in range(n)]
for j in range(1,t+1):
    for i in range(n):
        if i+2**j>=n:break
        if a[l[i][j-1]]<=a[l[i+2**(j-1)][j-1]]: l[i][j]=l[i][j-1]
        else:  l[i][j]=l[i+2**(j-1)][j-1]
o=[]
for x in range(1,n+1):
    m=0
    r=int(math.log2(x))
    for i in range(n):
        if x+i>n:break
        b=i+x-1
        m=max(m, min(a[l[i][r]],a[l[b-2**r+1][r]]))
    o.append(str(m))

print(' '.join(o))