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

using namespace std;

void print(vector<int> &v) {
  cout << v[0];
  for (auto it = ++v.begin(); it != v.end(); ++it)
    cout << " " << *it;
  cout << endl;
}

int main() {
  int n;
  cin >> n;
  vector<int> A(n);
  iota(A.begin(), A.end(), 1);
  print(A);
  while (next_permutation(A.begin(), A.end()))
    print(A);
}
