def insertion_sort(a, n)
  for i in (1..n-1)
    v = a[i]
    j = i - 1
    while j >= 0 && a[j] > v
      a[j+1] = a[j]
      j -= 1
    end
    a[j+1] = v
    puts a.join(" ")
  end
end

n = gets.to_i
ary = gets.chomp.split(" ").map(&:to_i)
puts ary.join(" ")
insertion_sort(ary, n)