def counting_sort(a)
  k = a.max
  c = Array.new(k + 1){ 0 }
  a.each{|n| c[n] += 1 }

  1.upto(k){|i| c[i] += c[i-1] }

  b = []
  (a.size-1).downto(0) do |i|
    b[c[a[i]]] = a[i]
    c[a[i]] -= 1
  end
  b
end

n = gets.to_s
a = gets.split.map(&:to_i)

puts counting_sort(a).join(" ")