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>
using namespace std;
static const int MAX_N = 9;

int n, a[MAX_N];

int main(){
	cin >> n;
	for(int i = 0; i < n; i++){
		a[i] = i + 1;
	}
	do{
		for(int i = 0; i < n; i++){
			cout << a[i];
			if(i == n - 1) cout << endl;
			else cout << ' ';
		}
	}while(next_permutation(a, a + n));
	return 0;
}

