#include<stdio.h>

int n,st[21],fol[21];

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

void solve()
{
 back(1);
}

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