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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	}

	static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	}

} 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	}

	static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	}

} 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	} 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	} 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		} int k = 0 ; int k = 0 ; k 0 k < n k n k++ k++ k {
			if(k != n - 1) {
				System.out.print(a[k] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		} {
			if(k != n - 1) {
				System.out.print(a[k] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		} if(k != n - 1) {
				System.out.print(a[k] + " ");
			} else {
				System.out.print(a[k]);
			} k != n - 1 k n - 1 n 1 {
				System.out.print(a[k] + " ");
			} System.out.print(a[k] + " ") System.out.print System.out System System.out a[k] + " " a[k] a k " " {
				System.out.print(a[k]);
			} System.out.print(a[k]) System.out.print System.out System System.out a[k] a k if(k == n - 1) System.out.println(); k == n - 1 k n - 1 n 1 System.out.println() System.out.println System.out System System.out insertionSort(a, n) insertionSort a n String[] args args static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	} insertionSort {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	} for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		} int i = 1 ; int i = 1 ; i 1 i < n i n 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			} int k = 0 ; int k = 0 ; k 0 k < n k n k++ k++ k {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			} {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			} if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				} k != n - 1 k n - 1 n 1 {
					System.out.print(a[k] + " ");
				} System.out.print(a[k] + " ") System.out.print System.out System System.out a[k] + " " a[k] a k " " {
					System.out.print(a[k]);
				} System.out.print(a[k]) System.out.print System.out System System.out a[k] a k if(k == n - 1) System.out.println(); k == n - 1 k n - 1 n 1 System.out.println() System.out.println System.out System System.out return a; a int[] a a int n n 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	}

	static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	}

	static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	}

} 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] + " ");
			} else {
				System.out.print(a[k]);
			}

			if(k == n - 1) System.out.println();
		}
		insertionSort(a, n);
	}

	static int[] insertionSort(int[] a, int n) {
		for(int i = 1 ; i < n ; 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 < n ; k++) {
				if(k != n - 1) {
					System.out.print(a[k] + " ");
				} else {
					System.out.print(a[k]);
				}

				if(k == n - 1) System.out.println();
			}
		}
		return a;
	}

}