#include <cstdio>

using namespace std;

void backt(int curr, int n, int used[],int st[]) {
	if (curr == n+1) {
		for(int i=1; i<=n; ++i)
			printf("%d ", st[i]);
		printf("\n");
	}

	for(int i=1; i<=n; ++i)
		if (!used[i]) {
			used[i] = true;
			st[curr] = i;
			backt(curr+1, n, used, st);
			used[i] = false;
		}
}


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

	int n;
	scanf("%d", &n);

	int used[n+1], st[n+1];

	for(int i=0; i<=n; ++i)
        used[i] = st[i] = 0;
    backt(1, n, used, st);

	return 0;
}