#include <stdio.h>
#define N 101
int n, sol[N];
bool v[N];

void afis()
{
	for (int i=1;i<=n;++i)
		printf("%d",sol[i]);
	printf("\n");
}

void back (int p)
{
	if (p==n+1)
	{
		afis();
		return;
	}
	for (int i=1; i<=n;++i)
		if (!v[i])
		{
			sol[p]=i;
			v[i]=true;
			back(p+1);
			v[i]=false;
		}
}

int main()
{
	freopen ("permutari.in","r",stdin);
	freopen ("permutari.out","w",stdout);
	scanf("%d",&n);
	back(1);
	return 0;
}