#include<stdio.h>
using namespace std;
int x[10],n;

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