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 <algorithm>
#include <vector>
#include <stdio.h>
#define MAX 10
using namespace std;

void Print(vector<int> &vec)
{
    printf("%d", vec[0]);
    for (unsigned i = 1; i < vec.size(); i++)
    {
        printf(" %d", vec[i]);
    }
    printf("\n");
}

int main()
{
    int n;
    scanf("%d", &n);

    vector<int> vec;
    for (int i = 1; i <= n; i++)
    {
        vec.push_back(i);
    }

    do
    {
        Print(vec);
    }while (next_permutation(vec.begin(), vec.end()));

    return 0;
}

