#include <fstream>

using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");
int n,st[10];

void Back(int k) 
{
	if (k > n) 
	{
		for (int i = 1;i <= n;i++)
			g << st[i] << " ";
		g << "\n";
		return;
	}
	for (int i = 1;i <= n;i++)
	{
		st[k] = i;
		bool ok = true;
		for (int j = 1;j < k;j++)
			if (st[k] == st[j])
				ok = false;
		if (ok)
		{
			Back(k + 1);
		}
	}

}

int main()
{
	f >> n;
	Back(1);
	f.close();
	g.close();
	return 0;
}