#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int perm[9], visited[9], n;
void back(int lg) {
	if(lg == n + 1) {
		for(int i = 1; i <= n; i++)
			g << perm[i] << " ";
		g << endl;
		return;
	}
	for(int i = 1; i <= n; i++) {
		if(visited[i] == 0) {
			visited[i] = 1;
			perm[lg] = i;
			back(lg + 1);
			visited[i] = 0;
		}
	}

}
int main() {
	f >> n;
	back(1);
	return 0;
}