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.
# Read in the number of bears and their heights
n = int(input())
heights = list(map(int, input().split()))

# Initialize a list to store the maximum strength for each group size
max_strengths = []

# Loop through each group size
for x in range(1, n+1):
  # Initialize the maximum strength for this group size to 0
  max_strength = 0
  # Loop through each group of size x
  for i in range(n - x + 1):
    # Calculate the strength of this group
    strength = min(heights[i:i+x])
    # Update the maximum strength if necessary
    max_strength = max(max_strength, strength)
  # Add the maximum strength for this group size to the list
  max_strengths.append(max_strength)

# Print the maximum strengths for each group size
print(*max_strengths)
