#include <stdio.h>

int n,p[10],uz[10];

void afis()
{
 long i;
 for (i=1;i<=n;++i)
      printf("%d ",p[i]);
      printf("\n");
}

void back(long k)
{
  long i;
  if (k==n+1)
      afis();
      else
      for (i=1;i<=n;++i)
	   if (!uz[i])
	   {
	   uz[i]=1;
	   p[k]=i;
	   back(k+1);
	   uz[i]=0;
	   }
}

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

 scanf("%d",&n);
 back(1);
 return 0;
}