 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 < a.length; i++) {
			a[i] = sc.nextInt();
		}
		printArray(a);
		new Main().insertionSort(a, n);

	}

	// 挿入ソート
	private void insertionSort(int[] a, int n) {

		for (int i = 1; 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;
			printArray(a);
		}
	}

	// 配列の中身を表示
	static private void printArray(int[] n) {
		for (int i = 0; i < n.length; i++) {
			if (i > 0) {
				System.out.print(" ");
			}
			System.out.print(n[i]);
		}
		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