#include <bits/stdc++.h>

using namespace std;

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

int n, v[10], st[10];

void backt (int k) {
  if (k == n + 1) {
    for (int i = 1; i <= n; i++)
      fout << st[i] << " ";
    fout << "\n";
  }
  else {
    for (int i = 1; i <= n; i++) {
      if (!v[i]) {
        st[k] = i; v[i] = 1;
        backt(k + 1);
        v[i] = 0;
      }
    }
  }
}

int main()
{
  fin >> n;
  backt(1);
  return 0;
}