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 collections import deque

class Solution():
	def minmax(heights):
		fwd_queue, bwd_queue = deque(), deque()
		fwd_high, bwd_high = list(range(len(heights))), list(range(len(heights)))

		for i in range(len(heights)):
			while len(bwd_queue) > 0 and heights[bwd_queue[-1]] >= heights[i]:
				bwd_queue.pop()
			bwd_high[i] = bwd_queue[-1] if len(bwd_queue) > 0 else -1
			bwd_queue.append(i)

		for i in range(len(heights)-1, -1, -1):
			while len(fwd_queue) > 0 and heights[fwd_queue[-1]] >= heights[i]:
				fwd_queue.pop()
			fwd_high[i] = fwd_queue[-1] if len(fwd_queue) > 0 else len(heights)
			fwd_queue.append(i)

		height_ranges = sorted([(heights[i], fwd_high[i]-bwd_high[i]-1) for i in range(len(heights))], reverse=True)

		result = [0]*(len(heights)+1)

		for height, length in height_ranges:
			while length > 0 and result[length] == 0:
				result[length] = height
				length -= 1
		return result


n = int(input())
arr = list(map(int, input().strip().split(' ')))

print(*Solution.minmax(arr)[1:])



