#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <queue>
using namespace std;
vector<bool> used;
vector<int> coefs;
FILE *g;
void perm(int i,int n)
{
	if (i==n){
		for (int j=0;j<n;j++)
		{
			fprintf(g,"%d ",coefs[j]+1);
		}
		fprintf(g,"\n");
	}
	else{
		for (int j=0;j<n;j++)
		{
			if (!used[j])
			{
				coefs[i]=j;
				used[j]=true;
				perm(i+1,n);
				used[j] =false;
			}
		}
	}
}
int main()
{
	FILE *f = fopen("permutari.in","r");
	int n;
	fscanf(f,"%d",&n);
	fclose(f);	
	used.resize(n);
	coefs.resize(n);
	for (int i=0;i<n;i++)
		used[i]= false;
	g = fopen("permutari.out","w+");
	perm(0,n);
	
	fclose(g);
	return 0;
}