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>
using namespace std;

void dfs(int pos, int *A, bool *U, const int N) {
  if (pos == N) {
    for (int i = 0; i < N; ++i) {
      if (i > 0) cout << ' ';
      cout << A[i];
    }
    cout << endl;
  } else {
    for (int i = 0; i < N; ++i) {
      if (U[i]) continue;
      A[pos] = i + 1;
      U[i] = true;
      dfs(pos + 1, A, U, N);
      U[i] = false;
    }
  }
}

int main() {
  int N;
  int A[9];
  bool U[9] = {};
  cin >> N;

  dfs(0, A, U, N);

  return 0;
}

