#include<fstream>
#define dmax 10
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");

int n, stack[dmax];
bool t[dmax];

void perm(int k)
{
	if(k == n+1)
	{
		for(int i = 1; i <= n; i++)
			out<<stack[i]<<" ";
		out<<'\n';
	}
	else
	{
		for(int i=1; i<=n; i++)
			if(!t[i])
			{
				t[i] = 1;
				stack[k] = i;
				perm(k+1);	
				t[i] = 0;
			}	
	}	
}

int main()
{
	in>>n;
	in.close();
	
	perm(1);
	
	out.close();
	return 0;
}