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())
bears = [ int(bear) for bear in input().split()]
group = []
for x in range(1,n+1):
	group = bears[0:x]
	group_min = min(group)
	min_index = group.index(group_min)
	max_strength = group_min

	for i in range(x, n):
		group = group[1:] + [ bears[i] ]
		if min_index == 0:
			group_min = min(group)
			min_index = group.index(group_min)
		elif group[-1] < group[min_index-1]:
			group_min = group[-1]
			min_index = x-1
		else:
			min_index -= 1
		
		if group_min > max_strength:
			max_strength = group_min

	print(max_strength, end=" ")
print()