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 <bits/stdc++.h>
using namespace std;
void display(vector<int> v) {
  for (size_t i = 0; i < v.size(); i++) {
    if (i)
      cout << " ";
    cout << v[i];
  }
  cout << endl;
}
int main() {
  int n;
  cin >> n;
  vector<int> v;
  int sum = 1;
  for (int i = 1; i <= n; i++) {
    v.push_back(i);
    sum *= i;
  }
  int cnt = 0;
  do {
    display(v);
    next_permutation(v.begin(), v.end());
    cnt++;
  } while (cnt < sum);
}
