import java.util.Scanner;

public class Main {
	void run() {
		// 入力
		Scanner scan = new Scanner(System.in);
		int[] array = new int[1000];
		int n = scan.nextInt();
		for(int i = 0; i < n; i++) {
			array[i] = scan.nextInt();
		}
		// ソート
		for(int i = 1; i < n; i++) {
			this.printArray(array, n);
			if(array[i] < array[i-1]) {
				for(int j = i; j > 0; j--) {
					if(array[j] >= array[j-1]) break;
					int tmp = array[j];
					array[j] = array[j-1];
					array[j-1] = tmp;
				}
			}
		}
		this.printArray(array, n);
	}
	
	void printArray(int[] array, int n) {
		for(int i = 0; i < n; i++) {
			System.out.print(array[i]);
			if(i == n-1) System.out.println();
			else System.out.print(" ");
		}
	}
	public static void main(String[] args) {
		new Main().run();
	}
}

/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