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<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;


int main(){
  long ii,jj,kk;
  vector<int> a;
  int n;

  cin >> n;

  a.resize(n);
  for(ii=1;ii<=n;ii++){
    a[ii-1] = ii;
  }

  do{
    for(ii=0;ii<n;ii++){
      cout << a[ii];
      if(ii != n-1){
        cout << " ";
      }
      else{
        cout << endl;
      }
    }    
  }while(next_permutation(a.begin(),a.end()));
  
  return 0;
}

