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

n = int(sys.stdin.readline())
heights = list(map(int, sys.stdin.readline().strip().split()))
left = [-1 for _ in range(n)]
right = [-1 for _ in range(n)]
dp = [-1 for _ in range(n+1)]


s = []
for i in range(n):
    while s:
        if heights[s[-1]] >= heights[i]: 
            s.pop()
        else:
            break
    if s: 
        left[i] = s[-1]

    s.append(i)

s = []
for i in range(n-1,-1,-1):
    while s:
        if heights[s[-1]] >= heights[i]:
            s.pop()
        else:
            break
    if s:
        right[i] = s[-1]

    s.append(i)

for i in range(n):
    span = right[i] - left[i] - 1
    dp[span] = max(dp[span], heights[i])

for i in range(n-1, 0, -1):
    dp[i] = max(dp[i], dp[i + 1])

for i in range(1, n+1):
    print(dp[i], end = ' ')

# def expand(start, end):
#     while start >= 0 and end < len(s):
#         if s[start] != s[end]:
#             break
#         start -= 1
#         end += 1
#     return [start+1, end]

# def solve():
#     output = [0,0]
    
#     for i in range(len(s)//2,len(s)):
#         if output[1] - output[0] > (len(s) - i) * 2:
#             break
#         cur1 = expand(i, i)
#         if cur1[1] - cur1[0] > output[1] - output[0]:
#             output = cur1

#         cur2 = expand(i, i+1)
#         if cur2[1] - cur2[0]  > output[1] - output[0]:
#             output = cur2
        
#         cur3 = expand(len(s) - i - 1, len(s) - i - 1)
#         if cur3[1] - cur3[0] > output[1] - output[0]:
#             output = cur3

#         cur4 = expand(len(s) - i - 1, len(s) - i - 1 +1)
#         if cur4[1] - cur4[0]  > output[1] - output[0]:
#             output = cur4

#     print(s[output[0]:output[1]])
 
# solve()