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.
n = int(input())
a = list(map(int, input().split()))

def dac(x):
    if len(x) == 1:
        return x
    mid = len(x)//2
    l = dac(x[:mid])
    r = dac(x[mid:])
    ans = [0 for i in range(len(x))]
    for i in range(len(l)):
        ans[i] = max(ans[i], l[i])
    for i in range(len(r)):
        ans[i] = max(ans[i], r[i])
    s = mid-1
    e = mid
    le = 2
    currMax = min(x[s], x[e])
    ans[le-1] = max(ans[le-1], currMax)
    while e-s < len(x)-1:
        if e == len(x)-1:
            down = True
        elif s == 0:
            down = False
        else:
            if x[s-1] > x[e+1]:
                down = True
            else:
                down = False
        if down:
            s -= 1
            currMax = min(currMax, x[s])
        else:
            e += 1
            currMax = min(currMax, x[e])
        le += 1
        ans[le-1] = max(ans[le-1], currMax)
    return ans

print(*dac(a))
