#include <fstream>
using namespace std;

int n;
int st[10], folosit[10];

ifstream fi("permutari.in");
ofstream fo("permutari.out");

void back(int k)
{
	if(k == n)
	{
		//tiparim solutia
		for(int i = 0; i < n; ++i) fo << st[i] << " ";
		fo << "\n";
	}
	else
	{
		for(st[k] = 1; st[k] <= n; ++st[k])
		{
			if(folosit[st[k]]) continue;
			folosit[st[k]] = 1;
			back(k + 1);
			folosit[st[k]] = 0;
		}
	}
}

int main()
{
	fi >> n;
	back(0);
	fi.close();
	fo.close();
	return 0;
}