def sort(array)
	a = array
	b = []
	c = []
	k = a.max
	
	##all elements of array c equal to 0
	for i in 0..k
		c[i] = 0
	end
	##insert +1 to c[element of array a]
	a.each do |el|
		c[el] = c[el] + 1
	end 
	#array c now contains the number of elements of array a
	##add the number of previous element starting from c[1]
	for i in 1..k
		c[i] = c[i] + c[i-1]
	end

	for j in (a.length-1).downto(0)
		b[c[a[j]]] = a[j]
		c[a[j]] = c[a[j]]-1
	end
	b.shift
	return b.join(" ")
end

#input
n = gets.chomp
n = gets.chomp
n = n.split().map(&:to_i)

#output
p sort(n)