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<tuple>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

#define INF ((int)(1e9))
#define MAX 11

int n, p[MAX],t[MAX];
bool next_parmutation(int a[], int b[]){
	priority_queue<int, vector<int>, greater<int>> Q;
	int num = -1, next = INF;
	for(int i = n-2; i >= 0; i--){
		if(a[i] < a[i+1]){
			num = i;
			break;
		}
	}
	if(num == -1) return false;
	
	for(int i = n-1; i > num; i--){
		if(a[num] < a[i])next = min(a[i],next);
	}
	for(int i = n-1; i >= num; i--){
		if(a[i] != next) Q.push(a[i]);
	}
	
	for(int i = 0; i < num; i++){
		b[i] = a[i];
	}
	
	b[num] = next;
	
	for(int i = num+1; i < n; i++){
		b[i] = Q.top(); Q.pop();
	}
	return true;
}

void p_array(int a[]){
	for(int i = 0; i < n; i++){
		cout<<(i?" ":"")<<a[i];
	}
	cout<<endl;
}

int main(){
	cin>>n;
	
	for(int i = 0; i < n; i++){
		p[i] = i+1;
	}
	
	do{ p_array(p);
	} while(next_parmutation(p,p));
	
	return 0;
}
