n = gets.chomp.to_i
a = gets.chomp.split(" ").map(&:to_i)
def insertionSort(a, n)
  puts a.join(" ")
  (1..n-1).each do |i|
    v = a[i]
    j = i - 1
    while j >= 0 and a[j] > v
      a[j+1] = a[j]
      j -= 1
    end
    a[j+1] = v
    puts a.join(" ")
  end
end

insertionSort(a, n)