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 calculate_resistance(n, a):
    r = [0] * (n + 1)
    stack = [(0, 0)]

    for i in range(1, n + 2):
        while a[i] < stack[-1][0]:
            r[i - stack[-2][1] - 1] = max(stack[-1][0], r[i - stack[-2][1] - 1])
            del stack[-1]
        stack.append((a[i], i))

    for i in range(n):
        r[-i - 2] = max(r[-i - 2], r[-i - 1])

    return r[1:]


if __name__ == "__main__":
    n = int(input())
    a = [0] * (n + 1)
    a[1:-1] = list(map(int, input().split()))

    result = calculate_resistance(n, a)
    print(' '.join(map(str, result)))
