#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n, took[10], is[10];

void back(int k){
  if(k == n){
    for(int i = 0; i < n; ++i)
      printf("%d ", is[i]);
    printf("\n");
    return;
  }

  for(int i = 1; i <= n; ++i)
    if(!took[i]){
      took[i] = 1;
      is[k] = i;
      back(k + 1);
      took[i] = 0;
    }
}

int main(){
  freopen("permutari.in", "r", stdin);
  freopen("permutari.out", "w", stdout);

  scanf("%d", &n);

  back(0);

  return 0;
}