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.
#!/usr/bin/env python3

N = input()
N = int(N)
A = input().split(' ')
A = list(map(int, A))

def get_L(A):
    L_candidates = [] # increasing list of indices with A smaller than anything considered so far
    L = A[:]

    for i in range(len(A)):
        while L_candidates and A[L_candidates[-1]] >= A[i]:
            L_candidates.pop()
        if L_candidates:
            L[i] = L_candidates[-1]
        else:
            L[i] = -1
        L_candidates.append(i)
    return L

L = get_L(A)
R = [N - x - 1 for x in get_L(A[::-1])][::-1]

strengths = [0] * (N + 3)
for i in range(N):
    p = R[i] - L[i] - 1
    strengths[p] = max(strengths[p], A[i])

strengths = strengths[1:N+1]

strengths = strengths[::-1]
for i in range(1, N):
    strengths[i] = max(strengths[i], strengths[i-1])
strengths = strengths[::-1]

print(' '.join(map(str, strengths)))