def CountingSort(a, b, k, n)
	c = []
	0.upto(k) do |i|
		c[i] = 0
	end

	1.upto(n) do |j|
		c[a[j]] += 1
	end

	1.upto(k) do |i|
		c[i] = c[i] + c[i-1]
	end

	n.downto(1) do |j|
		b[c[a[j]]] = a[j]
		c[a[j]] -= 1
	end
end

n = gets.to_i
a = gets.split.map &:to_i
a.unshift(0)
b = []
CountingSort(a, b, 10001, n)
b.shift
puts b.join(" ")