#include <bits/stdc++.h>

using namespace std;

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

const int MAX_N = 1e1 + 5;

int n;

vector <bool> used(MAX_N, 0);
vector <int> v(MAX_N, 0);

void bkt(int p) {
  if (p == n) {
    for (int i = 0; i < n; ++i) {
      fout << v[i] << " ";
    }
    fout << "\n";
  } else {
    for (int i = 1; i <= n; ++i) {
      if (used[i] == 0) {
        used[i] = 1;
        v[p] = i;
        bkt(p + 1);
        used[i] = 0;
      }
    }
  }
}

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