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

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int> vec;
    
    for(int i = 1; i <= N; ++i)
      vec.push_back(i);
    
    do
    {
        for(int i = 0; i < N; ++i)
          cout << (i == 0 ? "" : " ") << vec[i];
        cout << endl;  
    }
    while(next_permutation(vec.begin(), vec.end()));
    
    return 0;
}
