#!/usr/bin/env ruby

def countingSort(a)
  k = a.max + 1
  b = Array.new(k, 0)
  c = b.dup

  a.each do |aa|
    c[aa] += 1
  end

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

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

  b
end

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

puts countingSort(a).join(' ')