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(i) for i in input().split()]
l = [-1 for _ in range(n)]
r = [n for _ in range(n)]
answer = [0 for _ in range(n+1)]   
s = []
for i in range(n):
  while s and a[s[-1]] >= a[i]:
    s.pop()
  if s:
    l[i] = s[-1]
  s.append(i)
while s:
    s.pop()
for i in range(n-1, -1, -1):
    while s and a[s[-1]] >= a[i]:
        s.pop()
    if s:
        r[i] = s[-1]
    s.append(i)
for i in range(n):
  length = r[i] - l[i] - 1
  answer[length] = max(answer[length], a[i])
for i in range(n-1, -1, -1):
  answer[i] = max(answer[i], answer[i+1])
answer = answer[1:]
print(*answer)