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 <ostream>

void print_array(const int a[], int n) {
  for (int i = 0; i < n; ++i) {
    if (i > 0)
      std::cout << " ";
    std::cout << a[i];
  }
  std::cout << std::endl;
}

int main(int argc, char *argv[]) {
  int n;
  std::cin >> n;
  int a[10];
  for (int i = 0; i < n; ++i)
    a[i] = i + 1;

  do {
    print_array(a, n);
  } while (std::next_permutation(a, a + n));
}

