using namespace std;
#include<cstdio>
int n,i,sol[20];
bool uz[10];

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


void back(int p)
{
	int j;
	if(p==n+1) afis();
	else
		for(j=1;j<=n;j++)
			if(!uz[j])
			{
				sol[p]=j;
				uz[j]=1;
				back(p+1);
				uz[j]=0;
			}
}

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