

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int[] A = new int[N];
		for (int i = 0; i < N; i++) {
			A[i] = scan.nextInt();
		}
		insertionSort(A, N);
	}

	public static void insertionSort(int[] A, int N) {
		// ??????????????????
		String output = Arrays.toString(A).replaceAll(",", "");
		// ?????????????????????
		System.out.println(output.substring(1, output.length() - 1));
		
		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;
			}

			output = Arrays.toString(A).replaceAll(",", "");
			System.out.println(output.substring(1, output.length() - 1));
		}
	}
}
/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