#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[10000];
    for (int i = 0; i < n; i++)
    {
        a[i] = i+1;
    }
    sort(a, a + n);
    for (int i = 0; i < n; i++)
    {
        cout << a[i];
        if (i == n - 1)cout << endl;
        if (i != n - 1)cout << " ";
    }
    while (next_permutation(a,a+n))
    {
        for (int i = 0; i < n; i++)
        {
            cout << a[i];
            if (i == n - 1)cout << endl;
            if (i != n - 1)cout << " ";
       }
    }
}

### Prompt

In cpp, your task is to solve the following problem:

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

### Response

```cpp
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[10000];
    for (int i = 0; i < n; i++)
    {
        a[i] = i+1;
    }
    sort(a, a + n);
    for (int i = 0; i < n; i++)
    {
        cout << a[i];
        if (i == n - 1)cout << endl;
        if (i != n - 1)cout << " ";
    }
    while (next_permutation(a,a+n))
    {
        for (int i = 0; i < n; i++)
        {
            cout << a[i];
            if (i == n - 1)cout << endl;
            if (i != n - 1)cout << " ";
       }
    }
}

```