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 max_strengths(n, heights):
    left = [0] * n
    right = [0] * n

    for i in range(n):
        left[i] = i
        while left[i] > 0 and heights[left[i] - 1] >= heights[i]:
            left[i] = left[left[i] - 1]

    for i in range(n - 1, -1, -1):
        right[i] = i
        while right[i] < n - 1 and heights[right[i] + 1] >= heights[i]:
            right[i] = right[right[i] + 1]

    max_strength = [0] * (n + 1)
    for i in range(n):
        group_size = right[i] - left[i] + 1
        max_strength[group_size] = max(max_strength[group_size], heights[i])

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

    return max_strength[1:]


def main():
    n = int(input().strip())
    heights = list(map(int, input().strip().split()))
    result = max_strengths(n, heights)
    print(" ".join(map(str, result)))


if __name__ == "__main__":
    main()