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<cstdio>
#include<vector>
#include<math.h>
#include<algorithm>

using namespace std;


int main(){
    int len_array;
    scanf("%d",&len_array);
    vector<int> int_array(len_array);
    for(int i = 0; i < len_array;i++){
        int_array[i] = i+1;
    }
    do{
        for(int i = 0;i < len_array;i++){
            if(i != len_array-1) printf("%d ",int_array[i]);
            else printf("%d\n",int_array[i]);
        }
    }while(next_permutation(int_array.begin(),int_array.end()));
    
    return 0;
}
