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())
res=[0 for i in range(n+1)]
l=list(map(int,input().strip().split()))
t=l[:]
res[1]=max(l)
for i in range(2,n+1):
    t1=[0 for j in range(n-i+1)]
    big=0
    for k in range(n-i+1):
        t1[k]=min(t[k],l[k+i-1])
        if t1[k]>big:
            big=t1[k]
    res[i]=big
    t=t1[:]
    del(t1)
for i in res[1:]:
    print(i,end=' ')
print()
