#!/bin/python

def insertionSort(ar): 
   
    length = len(ar)
    if length >= 1 and length <=1000:
        v = ar[length -1]
        if v <=10000 and v >=-10000:
           
            for i in range(length -2,-1,-1):
               
                if ar[i] > v:
                    ar[i+1] = ar[i]
                    print " ".join(map(str,ar))
                else:
                    ar[i+1] = v
                    print " ".join(map(str,ar))
    return ""

m = input()
ar = [int(i) for i in raw_input().strip().split()]
insertionSort(ar)