#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int n;
	scanf("%d", &n);
	vector<int> v;
	for (int i = 0; i < n; i++)
		v.push_back(i + 1);
	do {
		for (int i = 0; i < n; i++) {
			printf(i < n - 1?"%d ":"%d\n", v[i]);
		}
	} while(next_permutation(v.begin(), v.end()));
}

### Prompt

In Cpp, your task is to solve the following problem:

For given an integer $n$, print all permutations of $\\{1, 2, ..., n\\}$ in lexicographic order.

Constraints

* $1 \leq n \leq 9$

Input

An integer $n$ is given in a line.

Output

Print each permutation in a line in order. Separate adjacency elements by a space character.

Examples

Input

2


Output

1 2
2 1


Input

3


Output

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int n;
	scanf("%d", &n);
	vector<int> v;
	for (int i = 0; i < n; i++)
		v.push_back(i + 1);
	do {
		for (int i = 0; i < n; i++) {
			printf(i < n - 1?"%d ":"%d\n", v[i]);
		}
	} while(next_permutation(v.begin(), v.end()));
}

```