#include<cstdio>
int n,k,p[9],u[9];

void A(int k)
{int i;
if(k-1==n)
     {for(i=1;i<=n;i++)
           printf("%d ",p[i]);
     printf("\n");}
else
     for(i=1;i<=n;i++)
     if(!u[i])
           p[k]=i,u[i]=1,A(k+1),u[i]=0;}

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