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 <bits/stdc++.h>
using namespace std;

int n;
bool udah[11];
int a[11];

void p(int digitke) {
	if (digitke>n) {
		for (int i=1; i<=n; i++) {
			if (i==1) cout<<a[i];
			else cout<<" "<<a[i];
		}
		cout<<endl;
	}
	else {
		for (int i=1; i<=n; i++) {
			if (udah[i]==false) {
				udah[i]=true;
				a[digitke]=i;
				p(digitke+1);
				udah[i]=false;
			}
		}
	}
}
int main() {
	cin>>n;
	p(1);
}

