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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> tmp(n);
	for (int i = 0; i < n; ++i) tmp[i] = i + 1;
	do {
		cout << tmp[0];
		for (int i = 1; i < n; ++i) cout << ' ' << tmp[i];
		cout << endl;
	} while (next_permutation(tmp.begin(), tmp.end()));
}
