#include <iostream>
#include <fstream>
using namespace std;

int sol[20], sel[20];
ifstream in("permutari.in");
ofstream out("permutari.out");

void afis(int n)
{
	for (int i=1;i<=n;i++)
		out<<sol[i]<<" ";
	out<<endl;
}

void permut(int n, int lvl)
{
	if (lvl == n+1)
	{
		afis(n);
		return;
	}
	int i;
	for (i=1;i<=n;i++)
		if (!sel[i])
		{
			sel[i] = 1;
			sol[lvl] = i;
			permut(n, lvl+1);
			sel[i] = 0;
		}
}

int main()
{
	int n; in>>n;
	permut(n,1);
}