import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	}

	private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

}
 import java.util.Scanner; Scanner java.util public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	}

	private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} Main static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	} main {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	} int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] A = inpNum(n); A inpNum(n) inpNum n insertionSort(A) insertionSort A String[] args args private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	} insertionSort {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	} for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		} int i = 0; int i = 0; i 0 i < A.length i A.length A A.length i++ i++ i {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		} {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		} int v = A[i]; v A[i] A i int j = i - 1; j i - 1 i 1 while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			} j >= 0 && A[j] > v j >= 0 j 0 A[j] > v A[j] A j v {
				A[j+1] = A[j];
				j--;

			} A[j+1] = A[j] A[j+1] A j+1 j 1 A[j] A j j-- j A[j+1] = v A[j+1] A j+1 j 1 v for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			} int k = 0; int k = 0; k 0 k < A.length k A.length A A.length k++ k++ k {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			} {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			} System.out.print(A[k]) System.out.print System.out System System.out A[k] A k if(k < A.length -1) {
					System.out.print(" ");
				} k < A.length -1 k A.length -1 A.length A A.length 1 {
					System.out.print(" ");
				} System.out.print(" ") System.out.print System.out System System.out " " System.out.println() System.out.println System.out System System.out int[] A A private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	} inpNum {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	} int[] nums = new int[n]; nums new int[n] n for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			nums[i] = sc.nextInt();
		} {
			nums[i] = sc.nextInt();
		} nums[i] = sc.nextInt() nums[i] nums i sc.nextInt() sc.nextInt sc return nums; nums int n n public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	}

	private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	}

	private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} Main
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		insertionSort(A);

	}

	private static void insertionSort(int[] A) {
		for (int i = 0; i < A.length; i++ ) {
			int v = A[i];
			int j = i - 1;

			while(j >= 0 && A[j] > v) {
				A[j+1] = A[j];
				j--;

			}

			A[j+1] = v;

			for (int k = 0; k < A.length; k++ ) {
				System.out.print(A[k]);
				if(k < A.length -1) {
					System.out.print(" ");
				}

			}
			System.out.println();


		}

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

}

