import java.util.Scanner;

public class Main { 
    public static void main(String[] args) {
    	
    	Scanner sc = new Scanner(System.in);
        int i, j, k, l;
        int N = sc.nextInt();
        int A[] = new int[N];
        
        for(i = 0; i < N; i++){
            j = sc.nextInt();
            A[i] =j;
        }
 
        for(i = 1; i <= N - 1; i++){
            for(k = 0; k < N; k++){
                System.out.print(A[k]);
                
                if(k != N - 1) System.out.print(" ");
            }
            
            System.out.println();
            l = A[i];
            j = i - 1;
            while(j >= 0 && A[j] > l){
                A[j + 1] = A[j];
                j--;
            }
            A[j + 1] = l;   
        }
        for(k = 0; k < N; k++){
            System.out.print(A[k]);
            if( k != N - 1) System.out.print(" ");
        }
        System.out.println();
    }
}


/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz