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.
from collections import deque


n = int(input())
arr = list(map(int, input().split()))

f = [[-1, n] for _ in range(n)]

q = deque()
for i, x in enumerate(arr):
    while q and arr[q[-1]] >= x:
        q.pop()

    f[i][0] = q[-1] if q else -1
    q.append(i)

q = deque()
for i in range(n-1, -1, -1):
    while q and arr[q[-1]] >= arr[i]:
        q.pop()

    f[i][1] = q[-1] if q else n
    q.append(i)

# print(f)
ans = [0] * n
for i in range(n):
    r = f[i][1] - f[i][0] - 2
    ans[r] = max(ans[r], arr[i])

pre = 0
for i in range(n-1, -1, -1):
    if(ans[i] == 0):
        ans[i] = pre
    else:
        pre = ans[i]

print(' '.join(map(str,ans)))


