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

def main():
    n=int(sys.stdin.readline())
    a=list(map(int,sys.stdin.readline().split()))
    dq=[]
    left_nearest=[-1]*n
    right_nearest=[n]*n
    for i in range(n):
        while len(dq) and a[dq[-1]] >= a[i]:
            del dq[-1]
        if len(dq):
            left_nearest[i]=dq[-1]
        dq.append(i)
    dq.clear()
    for i in range(n-1,-1,-1):
        while len(dq) and a[dq[-1]] >= a[i]:
            del dq[-1]
        if len(dq):
            right_nearest[i]=dq[-1]
        dq.append(i)

    ans=[-1] * (n+1)

    for i in range(n):
        length=right_nearest[i]-i+i-left_nearest[i]-1
        #print(i,length)
        ans[length]=max(ans[length],a[i])
    for i in range(n-1,0,-1):
        ans[i]=max(ans[i],ans[i+1])
    #print(' '.join(map(str,ans[1:])))
    sys.stdout.write(' '.join(map(str,ans[1:])))
main()
