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<vector>
#include<algorithm>
using namespace std;
vector<int>v;
void print()
{
    int ans=0;
    for(auto it=v.begin();it!=v.end();it++,ans++)
    {
        if(ans!=0)cout<<" ";
        cout<<*it;
    }
    cout<<endl;
}

int main()
{
    int n,i,j;
    cin>>n;
    v.resize(n);
    for(i=0;i<n;i++)
    {
        v[i]=i+1;
    }
    do{
       print();
    }while(next_permutation(v.begin(),v.end()));
    return 0;
}

