n = gets.chomp.to_i
ary = gets.chomp.split(' ').map(&:to_i)

def insertionSort(a, n)
  (1..n-1).each do |i|
  	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

puts ary.join(' ')
insertionSort(ary, n)
