output_description: The output consists of _N_ lines. Please output the intermediate sequence in a
  line for each step. Elements of the sequence should be separated by single
  space.
input_description: The first line of the input includes an integer N, the number of elements in
  the sequence.
  
  In the second line, _N_ elements of the sequence are given separated by a
  single space.
attempt: N = int(input())
  array = map(int, input().split())
  print(*array)
  
problem_description: Insertion Sort
  
  Write a program of the Insertion Sort algorithm which sorts a sequence A in
  ascending order. The algorithm should be based on the following pseudocode:
  
      
      
      for i = 1 to A.length-1
          key = A[i]
          /* insert A[i] into the sorted sequence A[0,...,j-1] */
          j = i - 1
          while j >= 0 and A[j] > key
              A[j+1] = A[j]
              j--
          A[j+1] = key
      
  
  Note that, indices for array elements are based on 0-origin.
  
  To illustrate the algorithms, your program should trace intermediate result
  for each step.
samples: [{"input": "6\n    5 2 4 6 1 3", "output": "5 2 4 6 1 3\n    2 5 4 6 1 3\n    2 4 5 6 1 3\n    2 4 5 6 1 3\n    1 2 4 5 6 3\n    1 2 3 4 5 6"}, {"input": "3\n    1 2 3", "output": "1 2 3\n    1 2 3\n    1 2 3"}]