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

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