#include <bits/stdc++.h>
using namespace std;

int n, a[100], v[100];

ofstream fout ("permutari.out");

void back(int lvl)
{
	if (lvl == n + 1)
	{
		for (int i = 1; i <= n; i++)
			fout << a[i] << ' ';
		fout << endl;
	}
	for (int i = 1; i <= n; i++)
		if (!v[i])
		{
			a[lvl] = i;
			v[i] = 1;
			back(lvl + 1);
			v[i] = 0;
		}
}

int main()
{
	ifstream cin("permutari.in");
	cin >> n;
	back(1);
	return 0;
}