#include<iostream>
using namespace std;
int main() {
	int A[101], N, i, j, temp;
	cin >> N;
	for (i = 0; i < N; i++)cin >> A[i];
	for (int i = 0; i < N; i++) {
		temp = A[i];
		j = i - 1;
		while (j >= 0 && A[j] > temp) {
			A[j + 1] = A[j];
			j--;
		}
		A[j + 1] = temp;
		for (j = 0; j < N; j++) {
			cout << A[j];
			if (j != N - 1)cout << " ";
		}
		cout << endl;
	}
}
### Prompt

Generate a Cpp solution to the following problem:

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.

Hint

Template in C

Constraints

1 ≤ N ≤ 100

Input

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.

Output

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.

Examples

Input

6
5 2 4 6 1 3


Output

5 2 4 6 1 3
2 5 4 6 1 3
2 4 5 6 1 3
2 4 5 6 1 3
1 2 4 5 6 3
1 2 3 4 5 6


Input

3
1 2 3


Output

1 2 3
1 2 3
1 2 3

### Response

```cpp
#include<iostream>
using namespace std;
int main() {
	int A[101], N, i, j, temp;
	cin >> N;
	for (i = 0; i < N; i++)cin >> A[i];
	for (int i = 0; i < N; i++) {
		temp = A[i];
		j = i - 1;
		while (j >= 0 && A[j] > temp) {
			A[j + 1] = A[j];
			j--;
		}
		A[j + 1] = temp;
		for (j = 0; j < N; j++) {
			cout << A[j];
			if (j != N - 1)cout << " ";
		}
		cout << endl;
	}
}
```