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;
int main(void) {
    int n;
    deque<int> deq;
    cin >> n;
    for (int i=1;i<n+1;i++) {
        deq.emplace_back(i);
    }
    do {
        for (int j=0;j<deq.size();j++) {
            if ( j==deq.size()-1 ) {
                cout << deq[j] << endl;
            } else {
                cout << deq[j] << " ";
            }
        }
    } while (next_permutation(deq.begin(),deq.end()));
    
    
}

