#include <fstream>

using namespace std;

int p[10], f[10];

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

void backt(int poz, int n) {
  int i;
  if (poz == n) {
    for (i = 1; i <= n; i++)
      cout << p[i] << ' ';
    cout << "\n";
  }
  else {
    for (i = 1; i <= n; i++)
      if (f[i] == 0) {
        p[poz + 1] = i;
        f[i] = 1;
        backt(poz + 1, n);
        f[i] = 0;
      }
  }
}

int main() {
  int n;
  cin >> n;
  backt(0, n);
  return 0;
}