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.
import sys
import io, os

ONLINE_JUDGE = True

if not ONLINE_JUDGE:
    sys.stdin = open("input.txt", "r")

############ ---- Input Functions ---- ############
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline


def inp():  # integer
    return int(input())


def inlt():  # lists
    return list(map(int, input().split()))


def insr():  # list of characters
    s = input()
    return list(s[: len(s) - 1])


def invr():  # space seperate integers
    return map(int, input().split())


############ ---- Solution ---- ############

MAX = 1000000

def bigarr():
    arr = [0] * MAX
    return arr


l = bigarr()
r = bigarr()
m = bigarr()

n = inp()
a = inlt()

stack = []

for i in range(n):
    while stack and a[stack[-1]] >= a[i]:
        stack.pop()
    l[i] = stack[-1] if stack else -1
    stack.append(i)

# clear
stack = []

for i in range(n - 1, -1, -1):
    while stack and a[stack[-1]] >= a[i]:
        stack.pop()
    r[i] = stack[-1] if stack else n
    stack.append(i)


for i in range(n):
  ln = r[i] - l[i] - 1
  m[ln] = max(m[ln], a[i])

for i in range(n, -1, -1):
  m[i] = max(m[i], m[i + 1])

for i in range(1, n + 1):
  print(m[i], end=" ")
