#include <cstdio>
const int NMAX = 9;
int n, P[NMAX];
bool taken[NMAX];

void back(int k, int P[], bool taken[]) {
  if (k == n + 1) {
    for (int i = 1; i < n; i++)
      printf("%d ", P[i]);
    printf("%d\n", P[n]);
    return ;
  }
  for (int i = 1; i <= n; i++)
    if (!taken[i]) {
      P[k] = i;
      taken[i] = true;
      back(k + 1, P, taken);
      taken[i] = false;
    }
}

int main() {
  freopen("permutari.in", "r", stdin);
  freopen("permutari.out", "w", stdout);
  
  scanf("%d", &n);
  back(1, P, taken);
  return 0;
}