import java.util.*;
public class Insertion{
    static Scanner in = new Scanner (System.in);

    public static int findInPlace (int []a, int x){
        int i = 0;
        while (a[i] < x && a[i] != 0)
        {
            i++;
        }
        return i;
    }

    public static int find (int []a, int x){
        int i = 0;
        while (i < a.length)
        {
            if (a[i] == x)
                return i;
            i++;
        }
        return i;
    }

    public static int []move (int []a, int zero, int place){
        for (int i = zero; i > place; i--)
        {
            a[i] = a[i - 1];
        }
        return a;
    }

    public static void insertInsortedWay (int []a, int x){
        int place = findInPlace(a,x);
        int zero = find(a,0);

        a = move(a, zero, place);
        a[place] = x;
    }
    public static void arrPelet (int []a){
        for (int j = 0; j < a.length; j++)
        {
            System.out.print(a[j] + "\t");
        }
    }
    public static void main(String[] args){
        int n;
        System.out.print("Enter array length -> ");
        n = in.nextInt();

        int []a = new int [n];
        int x;

        for (int i = 0; i < n; i++)
        {
            System.out.print("Enter x -> ");
            x = in.nextInt();
            insertInsortedWay (a,x);
            arrPelet(a);
            System.out.println("\n");
        }
    }
}
/*
Enter array length -> 7
Enter x -> 4
4   0   0   0   0   0   0
Enter x -> 6
4   6   0   0   0   0   0
Enter x -> 1
1   4   6   0   0   0   0
Enter x -> 2
1   2   4   6   0   0   0
Enter x -> 7
1   2   4   6   7   0   0
Enter x -> 5
1   2   4   5   6   7   0
Enter x -> 3
1   2   3   4   5   6   7
*/