def insertionSort(a):
    for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a)

n = int(input())
a = list(map(int,input().split()))

insertionSort(a) def insertionSort(a):
    for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a) insertionSort for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a) i v enumerate(a) enumerate a j=i-1 j i-1 i 1 while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
         j>=0 and a[j]>v j>=0 j 0 a[j]>v a[j] a j v a[j+1]=a[j] a[j+1] a j+1 j 1 a[j] a j j-=1 j 1 a[j+1]=v a[j+1] a j+1 j 1 v print(*a) print *a a a a n = int(input()) n int(input()) int input() input a = list(map(int,input().split())) a list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split insertionSort(a) insertionSort a n = int(input()) int(input()) n def insertionSort(a):
    for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a) def insertionSort(a):
    for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a) insertionSort a = list(map(int,input().split())) list(map(int,input().split())) a
def insertionSort(a):
    for i,v in enumerate(a):
        j=i-1
        while j>=0 and a[j]>v:
            a[j+1]=a[j]
            j-=1
        a[j+1]=v
        print(*a)

n = int(input())
a = list(map(int,input().split()))

insertionSort(a)