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<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) rep(i,0,n)

int main()
{
    int n;
    cin>>n;
    vector<int>a(n,1);

    REP(i,n-1)a[i+1]=a[i]+1;
    REP(i,n){if(i!=0)cout<<" ";cout<<a[i];}cout<<endl;
    while(next_permutation(a.begin(),a.end())){REP(i,n){if(i!=0)cout<<" ";cout<<a[i];}cout<<endl;}
}
