#include <cstdio>

int n;
int sir[10];

void print();
void back(int);

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

    scanf("%d", &n);    
    back(1);
}

void print() {
	for (int i = 1; i <= n; ++i) {
		printf("%d ", sir[i]);
	}
	printf("\n");
}

void back(int p) {
	bool cont = 0;
	for (int i = 1; i <= n; ++i) {
		sir[p] = i;
		cont = 0;
		for (int k = 1; k < p; ++k)
			if (sir[p] == sir[k]) {
				cont = 1;
				break;
			}
		if (cont) continue;

		if (p == n)
			print();
		else
			back(p + 1);
	}
}