import java.util.Scanner;

public class Main {

  static void trace(int[] a, int n) {
    for (int i = 0; i < n; i++) {
      if (i > 0) System.out.print(" ");
      System.out.print(a[i]);
    }
    System.out.println();
  }
    
  static void insertionSort(int[] a, int n) {
    int t, j;
    for (int i = 1; i < n; i++) {
      t = a[i];
      j = i - 1;
      while (j >= 0 && a[j] > t) {
        a[j + 1] = a[j];
        j--;
      }
      a[j + 1] = t;
      trace(a, n);
    }
  } 

  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    int n = stdIn.nextInt();
    int[] a = new int[n];
    for (int i = 0; i < n; i++) a[i] = stdIn.nextInt();
    trace(a, n);
    insertionSort(a, n);
  }
}
/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