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.
import sys

if __name__ == "__main__":
    n = int(input())
    arr = list(map(int, input().split()))
    li = [-1] * n
    ri = [n] * n

    stack = [n - 1]
    for p1 in range(n - 2, -1, -1):
        while arr[p1] < arr[stack[-1]] and stack:
            li[stack[-1]] = p1
            stack.pop(-1)
        stack.append(p1)
        p1 -= 1

    stack = [0]
    for p1 in range(1, n):
        while stack and arr[p1] < arr[stack[-1]]:
            ri[stack[-1]] = p1
            stack.pop(-1)
        stack.append(p1)
        p1 += 1

    ans = [0 for _ in range(n + 1)]
    i = 0
    while i < n:
        seq_length = i - li[i] + ri[i] - i - 1
        if ans[seq_length] < arr[i]:
            ans[seq_length] = arr[i]
        i += 1

    ele = -1
    while n > 0:
        ele = max(ans[n], ele)
        ans[n] = ele
        n -= 1
    ans.pop(0)
    answer = " ".join(map(str, ans))
    print(answer)