import java.util.Scanner;

public class Main {

	// sort method :: sort given array using insertion Sort
	public static void sort(int[] _A, int _n) {
		for (int i = 1; i < _n; ++i) {
			
			// print(_A);
			int tmp = _A[i];
			int j = i - 1;
			while (j >= 0 && _A[j] > tmp) {
				_A[j + 1] = _A[j];
				--j;
			}
			_A[j + 1] = tmp;
			print(_A);
			// System.out.println("i = " + i);
		}
		
	}
	
	// print method :: print array
	public static void print(int[] _A) {
		for (int i = 0; i < _A.length; ++i) {
			System.out.print(_A[i]);
			if (i != _A.length - 1)
				System.out.print(" ");
		}
		System.out.println();
	}

	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		////////////////////////////////////
		int n = 0;
		int[] A;
		
		n = sc.nextInt();
		sc.nextLine();
		A = new int[n];
		for (int i = 0; i < n; ++i)
			A[i] = sc.nextInt();
		
		print(A);
		sort(A, n);
		
		////////////////////////////////////
		sc.close();
	}
	
}
/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