#include<stdio.h>
#include<assert.h>

#include<vector>
#include<algorithm>

using namespace std;

int order;

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

  scanf("%d", &order);

  vector<int> perm;
  for(int i = 1; i <= order; ++i)
    perm.push_back(i);

  vector<int>::iterator it;
  do{
    for(it = perm.begin(); it < perm.end(); ++it)
      printf("%d ", *it);
    printf("\n");
  }while(next_permutation(perm.begin(), perm.end()));

  return 0;
}