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.
def printMaxOfMin(arr, n):
    stack = []
    left_smaller = [-1] * (n+1)
    right_smaller = [n] * (n+1)

    for i in range(n):
        while stack and arr[stack[-1]] >= arr[i]:
            stack.pop()
        if stack:
            left_smaller[i] = stack[-1]
        stack.append(i)

    while stack:
        stack.pop()

    for i in range(n-1, -1, -1):
        while stack and arr[stack[-1]] >= arr[i]:
            stack.pop()
        if stack:
            right_smaller[i] = stack[-1]
        stack.append(i)

    ans = [0]*(n+1)

    for i in range(n):
        window = right_smaller[i]-left_smaller[i]-1
        ans[window] = max(ans[window], arr[i])

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

    return ans[1:]


n = int(input())
arr = [int(i) for i in input().split()]
for i in printMaxOfMin(arr, n):
    print(i, end=" ")
print("")
