import java.util.*;

public class Binarysort {
    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++) {
            sort(a);
            out(a);
        }
    }
            // { 1, 4, 7, 8, 10, 10, 11, 13, 245}
    // { 0 , 0, 0 , 0, 0, 0, 0, 0, 0}
    // { 4, 0, 0 , 0, 0, 0, 0, 0, 0}
    // { 4, 10, 0, 0, 0, 0, 0, 0, 0}
        public static void sort(int[] a) {
        Scanner scan = new Scanner(System.in);
        int l = 0;
        a[l] = scan.nextInt();
        int j = a.length-1;
        int i = 0;
        int k = (j - i) / 2;
            while(k>0&&k<a.length) {
                if (a[k] > a[l]) {
                    j=k;
                    k=(j-1)/2;
                }else{
                    i=k;
                    k=(j+i)/2;
                }
                for(int z=k;z<a.length-2;z++){
                    z=a[z];
                    a[z+1]=z;


                }

            }




    }
    public static void out(int[] a) {
        System.out.println();
        for (int val : a) {
            System.out.print(val);
        }
    }


}