def quicksort(arr):
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quicksort(left) + middle + quicksort(right)
n = int(input())
x = input()
arr = x.split()
arr = (quicksort(arr))
for a in arr:
print(f"{a} ",end=ββ)