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())
arr = list(map(int,input().split()))

left,right = [0 for index in range(n)],[0 for index in range(n)] 
length = [0 for index in range(n)]
answer = [0 for index in range(n)]

stack = []
for index in range(n):
    while(len(stack) > 0 and arr[stack[-1]] >= arr[index]):
        stack.pop()
    if(len(stack) == 0):
        left[index] = -1
    else:
        left[index] = stack[-1]
    stack.append(index)
    
stack = []
for index in range(n-1,-1,-1):
    while(len(stack) > 0 and arr[stack[-1]] >= arr[index]):
        stack.pop()
    if(len(stack) == 0):
        right[index] = n
    else:
        right[index] = stack[-1]
    stack.append(index)
    
for index in range(n):
    length[index] = right[index] - left[index] - 1
    
for index in range(n):
    answer[length[index] - 1] = max(answer[length[index] - 1],arr[index])
    
for index in range(n-2,-1,-1):
    answer[index] = max(answer[index],answer[index+1])
    
print(*answer)