/* 
   Keep It Simple!
*/
#include<stdio.h>

int n;
int v[9];
int valid(int k)
{
	for(int i=1;i<k;i++)
		if(v[i]==v[k])
			return 0;
	return 1;
}
void afis()
{
	for(int i=1;i<=n;i++)
		printf("%d ",v[i]);
	printf("\n");
}
void back(int k)
{
	for(int i=1;i<=n;i++)
	{
		v[k]=i;
		  if(valid(k))
		  {
			  if(k == n)
				  afis();
			  else if(k<n)
				  back(k+1);
		  }
	}
}
int main()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	
	scanf("%d",&n);
	back(1);
}