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<algorithm>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0; i<n; i++){
        a[i]=i+1;
    }
    for(int i=0; i<n-1; i++)
        cout<<a[i]<<" ";
    cout<<a[n-1]<<endl;
    while(next_permutation(a, a+n)){
        for(int i=0; i<n-1; i++)
            cout<<a[i]<<" ";
    
        cout<<a[n-1]<<endl;
    }
    return 0;
}
