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>
using namespace std;
bool pernah[100];;
int catat[100],n,p;
void cetak(int kedalaman){
	if(kedalaman>n){
		for(int i =1;i<=n;i++){
			cout<<catat[i];
			if(i<n)cout<<" ";
		}
		cout<<endl;
		return;
	}
	else{
		for(int i=1;i<=n;i++){
			if(pernah[i]==false){
				pernah[i]=true;
				catat[kedalaman]=i;
				cetak(kedalaman+1);
				pernah[i]=false;
			}
		}
	}
}
int main(){
	cin>>n;
	cetak(1);
}

