/* 
Generarea permutarilor unei multimi folosind backtracking.
*/

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

#define MAXN	8

int n;
int solutie[MAXN];
bool gasit[MAXN];

void afiseaza_permutari () {
	int i;
	for (i = 0; i < n; i++)
		printf("%d ", solutie[i]);
	printf("\n");
}

void genereaza_permutari (int p) {
	if (p == n) 
		afiseaza_permutari();
	else {
		int i;
		for (i = 0; i < n; i++) {
			if (!gasit[i]) {
				gasit[i] = 1;
				solutie[p] = i + 1;
				genereaza_permutari(p + 1);
				gasit[i] = 0;
			}
		}
	}
}

int main () {
	freopen("permutari.in", "r", stdin);
	freopen("permutari.out", "w", stdout);

	scanf("%d", &n);
	genereaza_permutari(0);

	return 0;
}