/*
 * permutations of set {1, 2, ..., N} 
 */
#include <stdio.h>

#define NMAX 20

int N;

int sol[NMAX];
int used[NMAX];

int perm(int k) 
{
	int i;
	if (k == N+1) {
		for (i = 1; i <= N; i++)
			printf("%d ", sol[i]);
		printf("\n");
	}
	
	for (i = 1; i <= N; i++) {
		if (!used[i]) {
			used[i] = 1;
			sol[k] = i;
			perm(k+1);
			used[i] = 0;
		}
	}
}

int main(void)
{
	freopen("permutari.in", "r", stdin);
	freopen("permutari.out", "w", stdout);
	
	scanf("%d", &N);
	perm(1);

	return 0;
}