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 solve():
    n, = rv()
    h, = rl(1)
    smallertoleftindex = [-1] * n
    smallertorightindex = [n] * n
    temp = list()
    for i in range(n):
        while len(temp) > 0 and h[temp[-1]] >= h[i]: temp.pop(-1)
        smallertoleftindex[i] = -1 if len(temp) == 0 else temp[-1]
        temp.append(i)
    temp = list()
    for i in range(n - 1, - 1, - 1):
        while len(temp) > 0 and h[temp[-1]] >= h[i]: temp.pop(-1)
        smallertorightindex[i] = n if len(temp) == 0 else temp[-1]
        temp.append(i)
    res = [0] * (n + 1)
    for i in range(n):
        nums = smallertorightindex[i] - smallertoleftindex[i] - 1
        res[nums] = max(res[nums], h[i])
    for i in range(n - 1, 0, -1): res[i] = max(res[i], res[i + 1])
    print(' '.join(map(str, res[1:])))

def prt(l): return print(''.join(l))
def rv(): return map(int, input().split())
def rl(n): return [list(map(int, input().split())) for _ in range(n)]
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
solve()