#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
 
int n,i,p[10];
 
int main()
{
	FILE *intrare,*iesire;
	intrare=fopen("permutari.in","r");
 
	fscanf(intrare,"%d",&n);
	
	iesire=fopen("permutari.out","w");
	
	for(i=1;i<=n;i++) p[i]=i;
	
	do
	{
		for(i=1;i<=n;i++) fprintf(iesire,"%d ",p[i]);
		fprintf(iesire,"\n");
	}
	while(next_permutation (p+1,p+n+1));
	fclose(iesire);
	fclose(intrare);
	return 0;
}