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.
# -*- coding:utf-8 -*-

"""

created by shuangquan.huang at 1/8/20

"""

import collections
import time
import os
import sys
import bisect
import heapq
from typing import List


def solve(N, A):
    A = [float('inf')] + A + [float('inf')]
    left = [0 for i in range(N+2)]
    right = [N+1 for i in range(N+2)]
    
    q = []
    for i, v in enumerate(A):
        while q and q[-1][1] > v:
            j, u = q.pop()
            right[j] = i
        
        if q:
            j, u = q[-1]
            left[i] = j
        q.append((i, v))
    
    # print(left)
    # print(right)
    
    ans = [0 for _ in range(N+1)]
    for i, v in enumerate(A):
        for l in range(right[i]-left[i]):
            ans[l] = max(ans[l], v)
    
    print(' '.join(map(str, ans[1:])))
    
    
    
    
N = int(input())
A = [int(x) for x in input().split()]
solve(N, A)