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

int main(){

    int n;
    cin >> n;
    vector<int> vec(n);
    
    iota(vec.begin(), vec.end(), 1);

    do{
        for(auto it = vec.begin(); it != vec.end(); ++it){
            if(it != vec.begin()){
                cout << " ";
            }
            cout << *it;
        }
        cout << endl;
    }while(next_permutation(vec.begin(), vec.end()));

    return 0;
}
