#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream in("permutari.in");
ofstream out("permutari.out");

void solve() {
  int N;
  in >> N;
  vector<int> v;
  for (int i = 1; i <= N; ++  i) {
    v.push_back(i);
  }

  do {
    for (unsigned int i = 0; i < v.size(); ++i) {
      out << v[i] << (i == v.size() - 1 ? "" : " " );
    }
    out << endl;
  } while(next_permutation(v.begin(), v.end()));
};

int main() {
  solve();
  return 0;
}