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.
__author__ = 'kitkat'
import sys

#sys.stdin = open("in.txt")
MAXN = int(2e5+10)
try:
    while True:
        S = [0] * MAXN
        ans = [0] * MAXN
        L = [0] * MAXN
        R = [0] * MAXN
        n = int(input())
        val = list(map(int, input().split(" ")))
        top = -1
        for i in range(n):
            while ~top and val[i] <= val[S[top]]:
                top -= 1
            L[i] = S[top] if ~top else -1
            top += 1
            S[top] = i
        top = -1
        for i in range(n-1, -1, -1):
            while ~top and val[i] <= val[S[top]]:
                top -= 1
            R[i] = S[top] if ~top else n
            top += 1
            S[top] = i
        for i in range(n):
            ans[R[i] - L[i] - 1] = max(ans[R[i] - L[i] - 1], val[i])
        for i in range(n-1, -1, -1):
            ans[i] = max(ans[i], ans[i+1])
        for i in range(n):
            sys.stdout.write('%d '%ans[i])
        print("")
except EOFError:
    pass
