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

start = [0] * n
end = [0] * n
for i in range(n):
    start[i] = i;
    while start[i] - 1 >= 0 and a[i] <= a[start[i] - 1]:
        start[i] = start[start[i] - 1];
for i in range(n - 1, -1, -1):
    end[i] = i + 1;
    while end[i] < n and a[i] <= a[end[i]]:
        end[i] = end[end[i]]

max_strength = [0] * (n + 1)
for i in range(n):
    length = end[i] - start[i]
    if a[i] > max_strength[length]:
        max_strength[length] = a[i]
for i in range(n - 1, 0, -1):
    if max_strength[i + 1] > max_strength[i]:
        max_strength[i] = max_strength[i + 1]
for i in range(1, n + 1):
    print(max_strength[i], end=' ')
print()