import sys

def main():
    from sys import stdin
    n = int(stdin.readline())
    a = list(map(int, stdin.readline().split()))
    
    left = {}
    right = {}
    
    for i in range(n):
        t = a[i]
        if t not in left:
            left[t] = i
        right[t] = i
    
    intervals = []
    for t in left:
        l = left[t]
        r = right[t]
        intervals.append((-t, l, r))  # Sort by descending order of t
    
    intervals.sort()
    
    parent = list(range(n + 2))  # Parent array to track next available position
    
    def find(x):
        while parent[x] != x:
            parent[x] = parent[parent[x]]
            x = parent[x]
        return x
    
    b = [0] * n
    
    for nt, l, r in intervals:
        t = -nt
        current = find(l)
        while current <= r:
            b[current] = t
            parent[current] = current + 1
            current = find(current)
    
    print(' '.join(map(str, b)))

if __name__ == '__main__':
    main()