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())
ar = list(map(int, input().split()))
prev_smaller = [i + 1 for i in range(n)]
next_smaller = [n + 1] * n
stack = []
for index, value in enumerate(ar):
    while stack and ar[stack[-1]] >= value:
        stack.pop()
    if stack:
        prev_smaller[index] = stack[-1] + 1
    else:
        prev_smaller[index] = 0
    stack.append(index)
# print(*prev_smaller)
stack = []
for index in range(n - 1, -1, -1):
    while stack and ar[stack[-1]] >= ar[index]:
        stack.pop()
    if stack:
        next_smaller[index] = stack[-1] + 1
    stack.append(index) 
# print(*next_smaller)
min_elm = min(ar)
ans = [min_elm for _ in range(n + 1)]
for i in range(n):
    sz = next_smaller[i] - prev_smaller[i] - 1
    ans[sz] = max(ans[sz], ar[i])
for i in range(n - 1, 0, -1):
    ans[i] = max(ans[i], ans[i + 1])
print(*ans[1:])