from bisect import bisect_left

N = int(input())           
A = list(map(int, input().split()))
A = A[::-1]
j_max = max(A)
li = []
for i in range(j_max):
    li.append(N-bisect_left(A, i+1))

print(*li)