# include <stdio.h>
int sol[11],n;
bool valid( int p)
{
	for (int i=1;i<p;i++)
		if(sol[i]==sol[p]) return false;
	return true;
}
void afisare() 
{
	for (int i=1;i<=n;i++)
		printf("%d ",sol[i]);
	printf ("\n");
}

void bkt (int p)
{
	if(p==n+1)
	{
		afisare();
		return;
	}
	for(int i=1;i<=n;i++)
	{
		sol[p]=i;
		if(valid(p))
			bkt(p+1);
	}
}
int main()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf ("%d",&n);
	bkt(1);
	return 0;
}