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>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;



#define SIZE 10

int N;
int table[10];

int main(){

	scanf("%d",&N);

	for(int i = 0; i < N; i++){

		table[i] = i;
	}

	do{

		printf("%d",table[0]+1);

		for(int i = 1; i <= N-1; i++){

			printf(" %d",table[i]+1);
		}
		printf("\n");

	}while(next_permutation(table,table+N));

	return 0;
}


