#include<stdio.h>
int sol[11],n;
void back(int k)
{
	if(k>n)
	{
		for(register int i=1;i<=n;++i)
			printf("%d ",sol[i]);
		printf("\n");
	}
	else
	{
		for(register int i=k;i<=n;++i)
		{
			bool found=0;
			sol[k]=i;
			for(register int j=1;j<k;++j)
			{
				if(i==sol[j]){found=1; break;}
			}
			if(!found)
				back(k+1);
		}
	}
}
int main ()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
	back(1);
	return 0;
}