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() 
{
    int n, i;
    scanf("%d", &n);
    
    vector<int> v1;
    vector<int> v2;
    vector<vector<int> > vs;
    
    for(i = 1; i <= n; i++)
        v1.emplace_back(i);
    
    do
    {
        for(i = 0; i < n; i++)
            v2.emplace_back(v1[i]);
        vs.emplace_back(v2);
        v2.clear();
    } while(next_permutation(v1.begin(), v1.end()));
    
    sort(vs.begin(), vs.end());
    
    for(i = 0; i < (int)vs.size(); i++)
    {
        auto it = vs[i].begin();
        for(; it != --vs[i].end(); it++)
            printf("%d ", *it);
        printf("%d\n", *it);
    }
    
    return 0;
}
