n = int(input())
a = list(map(int,input().split()))
a1 = a[0]
import bisect
a.sort()
ans = []
for i in range(1, a1+1):
  t = bisect.bisect_left(a, i)
  ans.append(n - t)
print(*ans)