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())
    heights = list(map(int, input().split()))
    stack = []
    max_strengths = [0] * N
    for i in range(N):
        while stack and heights[i] <= heights[stack[-1]]:
            stack.pop()
        if stack:
            max_strengths[N-i-1] = max(max_strengths[N-i-1], min(heights[i], heights[stack[-1]]))
        else:
            max_strengths[N-i-1] = max(max_strengths[N-i-1], heights[i])
        stack.append(i)
    for i in range(N-2, -1, -1):
        max_strengths[i] = max(max_strengths[i], max_strengths[i+1])
    print(" ".join(str(x) for x in max_strengths))
