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 <vector>
#include <algorithm>

int main() {
    int n;
    std::cin >> n;

    std::vector<int> A(n);
    for (int i = 0; i < n; i++) {
        A[i] = i + 1;
    }

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

