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

int main()
{
    int n;
    cin>>n;
    vector<int> v1(n);
    for(int i=1;i<=n;i++){v1[i-1]=i;}
    for(int i=0;i<n;i++){
        if(i!=0)cout<<" ";
        cout<<v1[i];
    }
    cout<<"\n";
    while(next_permutation(v1.begin(),v1.end())){
        for(int i=0;i<n;i++){
            if(i!=0)cout<<" ";
            cout<<v1[i];
        }
        cout<<"\n";
    }





}


