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

#define r(i,n) for(int i=0;i<n;i++)
using namespace std;

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