#include<stdio.h>
int n,sol[11],m[11];
void bkt(int p)
{
	if (p==n+1)
	{	
		for (int i=1;i<=n;i++)
			printf("%d ", sol[i]);
		printf("\n");
		return;
	}
	
	for(int i=1;i<=n;i++)
	{
		if(m[i])continue;
		sol[p]=i;
		m[i]=true;
		bkt(p+1);
		m[i]=false;
	}
}
int main()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
	bkt(1);
	return 0;
}