VMAX = 10000
n = int(input())
A = list(map(int,input().split()))
B = [0] * n

def countingSort(A,B,k):
  C = [0] * (k + 1)
  for j in range(n):
    C[A[j]] += 1
  for i in range(k):
    C[i+1] = C[i+1] + C[i]
  for j in range(n-1,-1,-1):
    B[C[A[j]]-1] = A[j]
    C[A[j]] -= 1
  return B

print(*countingSort(A,B,VMAX))

#example input
#7
#2 5 1 3 2 3 0
#0 1 2 2 3 3 5