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 itertools import accumulate


n = int(input())

lst = list(map(int, input().split()))

l = [0] * n
r = [0] * n

stack1 = []
stack2 = []

for i in range(n):

    while stack1 and lst[stack1[-1]] >= lst[i]:
        stack1.pop()

    
    if not stack1:
        l[i] = -1
    else:
        l[i] = stack1[-1]

    stack1.append(i)

for j in range(n - 1, -1 , -1):

    while stack2 and lst[stack2[-1]]>= lst[j]:
        stack2.pop()
    
    if not stack2:
        r[j] = n
    else:
        r[j] = stack2[-1]

    stack2.append(j)


  
ans = [0] * (n + 1)

for i in range(n):

    right = r[i] - l[i] - 1
    ans[right] = max(lst[i], ans[right])


for i in range(n - 1, -1, -1):

    ans[i] = max(ans[i] , ans[i + 1])

print(*ans[1:])


    

