def countingSort(a, b, k)
  n = a.size
  c = Array.new(k+1){0}
  0.upto(n-1){|j|
    c[a[j]] += 1
  }
  1.upto(k){|i|
    c[i] += c[i-1]
  }
  (n-1).downto(0){|j|
    b[c[a[j]]-1] = a[j]
    c[a[j]] -= 1
  }
end

n = gets.to_i
arr = gets.split.map(&:to_i)
k = arr.max
ans = Array.new(n)

countingSort(arr, ans, k)
puts ans.join(" ")