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

left, right = [-1] * n, [n] * n

stack = []

for i, v in enumerate(arr):
    while stack and stack[-1][0] > v:
        right[stack.pop()[1]] = i
    stack.append((v, i))

for i in range(n - 1, -1, -1):
    while stack and stack[-1][0] > arr[i]:
        left[stack.pop()[1]] = i
    stack.append((arr[i], i))

ans = [-1] * n

for i, v in enumerate(arr):
    size = right[i] - left[i] - 2
    if v > ans[size]:
        ans[size] = v

for i in range(n - 2, -1, -1):
    if ans[i + 1] > ans[i]:
        ans[i] = ans[i + 1]

print(*ans)