import heapq


class Set_min(set):
    def __init__(self, iterable=tuple()):
        super(Set_min, self).__init__(iterable)
        self.h = list(iterable)
        heapq.heapify(self.h)

    def add(self, x):
        super(Set_min, self).add(x)
        heapq.heappush(self.h, x)

    def remove(self, x):
        super(Set_min, self).remove(x)

    def min(self):
        if not super(Set_min, self).__len__():
            raise ValueError
        while self.h and self.h[0] not in self:
            heapq.heappop(self.h)
        return self.h[0]


N = int(input())
A = tuple(map(int, input().split()))

R = dict()
for i, a in enumerate(A):
    R[a] = i

st = Set_min()
ans = [0] * N
for i, a in enumerate(A):
    st.add(-a)
    ans[i] = -st.min()
    if R[a] == i:
        st.remove(-a)
print(*ans)