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
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define int long long
using namespace std;
bool b[10];
int n, a[10];
void f(int k) {
	if (k == n) {
		for (int i = 0; i < n; i++) {
			if (i)cout << ' '; cout << a[i];
		}cout << endl;
	}
	for (int i = 1; i <= n; i++)if (!b[i]) {
		b[i] = 1;
		a[k] = i;
		f(k + 1);
		b[i] = 0;
	}
	return;
}
signed main() {
	cin >> n; f(0);
}
