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.
from sys import stdin

def lmap(function, iterable): return list(map(function, iterable))
def line(): return stdin.readline().strip()
def rd(converter): return converter(line())
def rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))
def rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]
def rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]

MULTIPLE_CASES = 0

def main():
    N = rd(int)
    A = rl(int)

    nums = sorted([[num,i] for i,num in enumerate(A)],reverse=True)
    ans = [0]*(N+1)
    ans[1] = nums[0][0]
    parents = list(range(N))
    sizes = [1]*N
    seen = set()

    def find(x):
        if parents[x] != x: parents[x] = find(parents[x])
        return parents[x]

    def union(x1,x2):
        x1,x2 = find(x1),find(x2)

        if x1 != x2:
            sizes[x1] += sizes[x2]
            sizes[x2] = 0
            parents[x2] = x1

        return x1

    for num,i in nums:
        if i-1 in seen:
            size = sizes[union(i,i-1)]
            ans[size] = max(ans[size], num)

        if i+1 in seen:
            size = sizes[union(i,i+1)]
            ans[size] = max(ans[size], num)

        seen.add(i)

    print(*ans[1:])

for i in range(rd(int) if MULTIPLE_CASES else 1): main()