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

### Prompt

Please formulate a CPP solution to 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 arr[100];
    for (int i = 0; i < n; i++)
        arr[i] = i+1;
    do {
        for (int i = 0; i < n; i++) {
            if (i == n - 1)
                cout << arr[i] << endl;
            else cout << arr[i] << " ";
        }
    } while (next_permutation(arr, arr + n));
}

```