def insertionSort(a, n)
  puts a.join(' ')
  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
      a[j+1] = v
    end
    puts a.join(' ')
  end
end

n = gets.to_i
a = gets.split(" ").map(&:to_i)
insertionSort(a, n)

