#include <fstream>
#define nmax 8
using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");

int n,s[nmax];
bool uz[nmax];

void read ()
{
	f>>n;
	f.close ();
}

void afisare ()
{
	for (int i=1; i<=n; i++)
		g<<s[i]<<" ";
	g<<'\n';
}

void solve (int k)
{
	if (k>n)
		afisare ();
	else 
	for (int i=1; i<=n; i++)
		if (!uz[i])
		{
			uz[i]=true;
			s[k]=i;
			solve (k+1);
			uz[i]=false;
		}
}

int main ()
{
	read ();
	solve (1);
	return 0;
}