#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>

using namespace std;

FILE *fin, *fout;

int A[10000];

int main()
{
    int n,i,j,key;
    fin=fopen("insertion-sort.in", "r");
    fscanf(fin, "%d", &n);
    for (i=1;i<=n;i++){
        fscanf(fin, "%d", &A[i]);
    }
    fclose(fin);
    for (i=2;i<=n;i++){
        key=A[i];
        j=i-1;
        while (j>0 && A[j]>key){
            A[j+1]=A[j];
            j=j-1;
        }
        A[j+1]=key;
        for (int k=1;k<=n;k++){
            printf("%d ", A[k]);
        }
        printf("\n");
    }
    fout=fopen("insertion-sort.out", "w");
    for (i=1;i<=n;i++){
        fprintf(fout, "%d ", A[i]);
    }
    fclose(fout);
    return 0;
}