#include <cstdio>
#include <cassert>
#include <algorithm>
#define Nmax 10
#define InFile "permutari.in"
#define OutFile "permutari.out"

using namespace std;

int n, p[Nmax];

int main()
{
  int i;
  assert (freopen (InFile, "r", stdin));
  assert (freopen (OutFile, "w", stdout));
  scanf ("%d\n", &n);
  for (i=1; i<=n; i++)
    p[i]=i;
  do
  {
    for (i=1; i<=n; i++)
      printf ("%d ", p[i]);
    printf ("\n");
  }
  while (next_permutation (p+1, p+n+1));
  return 0;
}