#include<cstdio>
using namespace std;
int x[10],n,k;
int cont (int k)
{
	for(int i=1;i<k;++i)
		if(x[k]==x[i])
			return 0;
	return 1;
}
void afis ()
{
	for(int i=1;i<=n;++i)
		printf("%d ",x[i]);
	printf("\n");
}
void back (int k)
{
	for(int i=1;i<=n;++i)
	{
		x[k]=i;
		if(cont(k))
			if(k==n)
				afis ();
			else
				back (k+1);
	}
}
int main ()
{
	
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
	back (1);
	return 0;
}