n = gets.to_i
a = []
n.times{
  a << gets.to_i
}
def sort(a)
  for i in 1..a.size-1
    p a
    v = a[i]
    j = i - 1
    while j >= 0 && a[j] > v
      a[j+1] = a[j]
      j -= 1
    end
    a[j+1] = v
  end
end

sort(a)
p a