import java.util.*;

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++) {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        }
                }
        }
} import java.util.*; util.* java 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++) {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        }
                }
        }
} 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++) {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\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++) {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\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++) {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\n");
                        }
                } int k = 0; int k = 0; k 0 k < N k N k++ k++ k {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\n");
                        }
                } {
                        System.out.print(A[k]);
                        if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\n");
                        }
                } System.out.print(A[k]) System.out.print System.out System System.out A[k] A k if (k!=N-1) {
                                System.out.print(" ");
                        } else {
                                System.out.print("\n");
                        } k!=N-1 k N-1 N 1 {
                                System.out.print(" ");
                        } System.out.print(" ") System.out.print System.out System System.out " " {
                                System.out.print("\n");
                        } System.out.print("\n") System.out.print System.out System System.out "\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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        }
                } 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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        }
                } {
                        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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        }
                } 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++) {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        } int k = 0; int k = 0; k 0 k < N k N k++ k++ k {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        } {
                                System.out.print(A[k]);
                                if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                }
                        } System.out.print(A[k]) System.out.print System.out System System.out A[k] A k if (k!=N-1) {
                                        System.out.print(" ");
                                } else {
                                        System.out.print("\n");
                                } k!=N-1 k N-1 N 1 {
                                        System.out.print(" ");
                                } System.out.print(" ") System.out.print System.out System System.out " " {
                                        System.out.print("\n");
                                } System.out.print("\n") System.out.print System.out System System.out "\n" String args[] args
import java.util.*;

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