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 disp(const vector<int>& a){
  for(int i = 0; i < a.size(); i++){
    if(i > 0) cout << " ";
    cout << a[i];
  }
  cout << endl;
}

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  for(int i = 0; i < n; i++){
    a[i] = i + 1;
  }
  disp(a);
  while(next_permutation(a.begin(), a.end())){
    disp(a);
  }
  return 0;
}
