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