N=gets.to_i
A=gets.split.map(&:to_i)

puts A.join(" ")

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

