#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#define MaxN 100005
using namespace std;

FILE*IN,*OUT;

int N,Steps=1;
vector <int>v;

int main()
{
	IN=fopen("permutari.in","r");
	OUT=fopen("permutari.out","w");

	fscanf(IN,"%d",&N);
	for(int i=1;i<=N;i++)
		Steps*=i,v.push_back(i);
	for(int i=1;i<=Steps;i++)
	{
		for(int i=0;i<N;i++)
			fprintf(OUT,"%d ",v[i]);
		fprintf(OUT,"\n");
		next_permutation(v.begin(),v.end());
	}
	return 0;
}