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 =  list(map(int, input().split()))[0]
lst = list(map(int, input().split()))


sorted_index = sorted(range(n), key=lambda k: lst[k], reverse=True)

lookup = dict()
for i in range(n):
    lookup[i] = (0, 0)

res = []
res_pos = 1
for index in sorted_index:
    seq_len = lookup[index][0] + lookup[index][1] + 1
    if seq_len >= res_pos:
        step = seq_len - res_pos + 1
        res += [lst[index]] * step
        res_pos += step

    step_back = lookup[index][0] + 1
    try:
        lookup[index - step_back] = (lookup[index - step_back][0],
                                     lookup[index - step_back][1] + 1 + lookup[index][1])
    except:
        pass

    step_forward = lookup[index][1] + 1
    try:
        lookup[index + step_forward] = (lookup[index + step_forward][0] + 1 + lookup[index][0],
                                        lookup[index + step_forward][1])
    except:
        pass

print(res)