#include<stdio.h>
#include<algorithm>
using namespace std;
int nr,p,i,n,a[10];
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
p=1;
for(i=1;i<=n;i++)
	p=p*i;
for(i=1;i<=n;i++)
	a[i]=i;
while(1)
{
	for(i=1;i<=n;i++)
		printf("%d ",a[i]);
	printf("\n");
	nr++;
	if(nr==p) break;
	next_permutation(a+1,a+n+1);
}
return 0;
}