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())

data = [int(x) for x in input().split()]

left = []
stack = []
for i in range(n):
    while len(stack) and data[i] <= data[stack[len(stack) - 1]]:
        a = stack.pop()
    if not stack:
        left.append(-1)
    else:
        left.append(stack[len(stack) - 1])
    stack.append(i)

stack = []
right = []
for i in range(n - 1, -1, -1):
    while len(stack) and data[i] <= data[stack[len(stack) - 1]]:
        stack.pop()
    if not stack:
        right.insert(0, n)
    else:
        right.insert(0, stack[len(stack) - 1])
    stack.append(i)
ans = [0 for x in range(n)]
for i in range(n):
    lenCheck = right[i] - left[i] - 1
    ans[lenCheck - 1] = max(ans[lenCheck - 1], data[i])

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

print(" ".join([str(x) for x in ans]))
