#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>


std::ifstream f("permutari.in");
std::ofstream g("permutari.out");
std::vector<int> v; int n;


int main()
{
	f >> n;
	v.resize(n);
	for (int i = 0; i < n; i++) {
		v[i] = i + 1;
	}

	do {
		for (int i = 0; i < n; i++) {
			g << v[i] << ' ';
		}
		g << '\n';
	} while (std::next_permutation(v.begin(), v.end()));

	return 0;
}