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 argmin(arr, l, r):
    min_idx = l
    for i in range(l, r):
        if arr[min_idx] > arr[i]:
            min_idx = i
    return min_idx


def max_merge(a, b):
    if len(a) > len(b):
        a, b = b, a

    for i in range(len(a)):
        yield max(b[i], a[i])

    for j in range(len(a), len(b)):
        yield b[j]


def q(childs, l, r):
    if r <= l:
        return []

    if l + 1 == r:
        return [childs[l]]

    m = argmin(childs, l, r)
    left = q(childs, l, m)
    right = q(childs, m + 1, r)

    res = [a for a in max_merge(left, right)] + [childs[m]] * (r - l - max(len(left), len(right)))

    return res


def task2(childs: list) -> list:
    return q(childs, 0, len(childs))


a = int(input())
arr = list(map(int, input().split()))
print(*task2(arr))
