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 = int(input())
a = [int(x) for x in input().split()]
el = []
s = [(-1e9,-1)]
for i,x in enumerate(a):
    while s[-1][0] > x:
        s.pop()
    el.append(i - s[-1][1])
    s.append((x,i))
s = [(-1e9,n)]
er = []
for i,x in reversed(list(enumerate(a))):
    while s[-1][0] >= x:
        s.pop()
    er.append(s[-1][1] - i)
    s.append((x,i))
er = list(reversed(er))
e = [l+r-1 for l,r in zip(el,er)]
ans = [0]*n
for x, ex in zip(a,e):
    ans[ex-1] = max(x, ans[ex-1])
for i in reversed(list(range(n))):
    if not ans[i]:
        ans[i] = ans[i+1]
print(" ".join(map(str,ans)))