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

using namespace std;


void output(vector<int> & V);

int main()
{
    vector<int> V;

    int n;
    cin >> n;

    for (int i = 1; i <= n; i++)
    {
        V.push_back(i);
    }

    do
    {
        output(V);
    } while (next_permutation(V.begin(), V.end()));
    

}


void output(vector<int> & V)
{
    vector<int>::iterator it = V.begin();
    cout << *it++;
    while (it != V.end())
    {
        
        cout << ' ' << *it;
        it++;
    }
    cout << endl;
}
