#include <cstdio>
#include <algorithm>
using namespace std;

inline int next_int() {
	int d;
	scanf("%d", &d);
	return d;
}

int n, A[10];

int main() {
	freopen("permutari.in", "r", stdin);
	freopen("permutari.out", "w", stdout);
	n = next_int();
	for (int i = 0; i < n; i++) {
		A[i] = i + 1;
	}
	do {
		for (int i = 0; i < n; i++) {
			printf("%d ", A[i]);
		}
		printf("\n");
	} while (next_permutation(A, A + n));
	return 0;
}