import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	}

	public static void insertionSort(int n, int[] a) {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	}
}
 import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	}

	public static void insertionSort(int n, int[] a) {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int a[] = new int[n]; a new int[n] n for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			a[i] = sc.nextInt();
		} {
			a[i] = sc.nextInt();
		} a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		} int k = 0; int k = 0; k 0 k < n k n k++ k++ k {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		} {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		} if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			} k != n - 1 k n - 1 n 1 {
				System.out.print(a[k]);
				System.out.print(" ");
			} System.out.print(a[k]) System.out.print System.out System System.out a[k] a k System.out.print(" ") System.out.print System.out System System.out " " {
				System.out.println(a[k]);
			} System.out.println(a[k]) System.out.println System.out System System.out a[k] a k insertionSort(n, a) insertionSort n a String[] args args public static void insertionSort(int n, int[] a) {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	} insertionSort {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	} int j j v; v for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		} int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		} {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		} v = a[i] v a[i] a i 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 < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			} int k = 0; int k = 0; k 0 k < n k n k++ k++ k {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			} {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			} if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				} k != n - 1 k n - 1 n 1 {
					System.out.print(a[k]);
					System.out.print(" ");
				} System.out.print(a[k]) System.out.print System.out System System.out a[k] a k System.out.print(" ") System.out.print System.out System System.out " " {
					System.out.println(a[k]);
				} System.out.println(a[k]) System.out.println System.out System System.out a[k] a k int n n int[] a a public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	}

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

	public static void insertionSort(int n, int[] a) {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int k = 0; k < n; k++) {
			if (k != n - 1) {
				System.out.print(a[k]);
				System.out.print(" ");
			} else {
				System.out.println(a[k]);
			}
		}
		insertionSort(n, a);
	}

	public static void insertionSort(int n, int[] a) {
		int j, v;
		for (int i = 1; i < n; i++) {
			v = a[i];
			j = i - 1;
			while (j >= 0 && a[j] > v) {
				a[j + 1] = a[j];
				j--;
			}
			a[j + 1] = v;
			for (int k = 0; k < n; k++) {
				if (k != n - 1) {
					System.out.print(a[k]);
					System.out.print(" ");
				} else {
					System.out.println(a[k]);
				}
			}
		}
	}
}

