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 <stdio.h>
#include <algorithm>
using namespace std;
int main(){
    int n,a[20],tot=1;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        a[i]=i;
        tot*=i;
    }
    for(int i=0;i<tot;i++){
        printf("%d",a[1]);
        for(int j=2;j<=n;j++)printf(" %d",a[j]);
        printf("\n");
        next_permutation(a+1,a+n+1);
    }
}
