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 <vector>
#include <iostream>
#include <algorithm>

using std::cin;
using std::cout;
using std::vector;
using std::for_each;
using std::generate;
using std::next_permutation;

int main() {
	int n;
	cin >> n;
	vector<int> v(n);
	generate(v.begin(),v.end(),[](){
		static int i = 1;
		return i++;
	});
	for_each(v.begin(),v.end(),[n](int _e){
		static int j = 1;
		cout << _e << (j++ == n ? "\n" : " ");
	});
	while (next_permutation(v.begin(),v.end())) {
		int k = 1;
		for_each(v.begin(),v.end(),[&k,n](int _e){cout << _e << (k++ == n ? "\n" : " ");});
	}
}
