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 <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
//#define LOCAL
using namespace std;
typedef long long ll;
const int mx=1e5+10;
ll a[mx];

void display(ll n, ll num[mx]){
    for(ll i=1;i<=n;i++){
        if(1==i)printf("%lld", num[i]);
        else printf(" %lld", num[i]);
    }
    puts("");
}


int main() {
#ifdef LOCAL
ifstream fin("1.txt");
streambuf*p;
p=cin.rdbuf(fin.rdbuf());
#endif // LOCAL
ll n;
cin>>n;
for(ll i=1;i<=n;i++) a[i]=i;
display(n, a);
while(next_permutation(a+1, a+1+n)){
    display(n, a);
}


#ifdef LOCAL
fin.close();
#endif // LOCAL
}


