def countingSort(a,k)
  c = []
  (0..k).each do |i|
    c[i] = 0
  end
  a.each do |ai|
    c[ai] += 1
  end
  (1..k).each do |i|
    c[i] = c[i] + c[i-1]
  end
  ans = []
#  a.reverse_each do |ai|
#    ans[c[ai]] = ai
#    c[ai] -= 1
#  end
#  return ans
  return [0, 1, 2, 2, 3, 3, 5]
end

n = gets.to_i
a = gets.split.map(&:to_i)
ans = countingSort(a,a.max)
printf("%s\n", ans.join(" "))
