#include <bits/stdc++.h>
using namespace std;
int factorial(int s)
{
    if (s<=1){return 1;}
    else {return s*factorial(s-1);}
}
int main()
{
  ifstream input;
  input.open("permutari.in");
  ofstream output;
  output.open("permutari.out");
  int n;
  input>>n;
  vector<int> v;
  for (int i=1;i<=n;i++){
    v.push_back(i);
  }
  for (auto it=v.begin();it!=v.end();it++){
    output<<*it<<" ";
  }
  cout<<'\n';
  int k=1;
  while(k<factorial(n)){
    next_permutation(v.begin(),v.end());
    for (auto it=v.begin();it!=v.end();it++){
        output<<*it<<" ";
    }
    output<<'\n';
    k++;
  }
  input.close();
  output.close();
}