#include<stdio.h>

int N;
int solutie[10];

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

void backtrack(int k) {
    if(k > N) {
        afisare();
    } else {
        for(int i = 1; i <= N; i++) {
            solutie[k] = i;
            int q = 0;
            for(int j = 1; j <= k; j++){
                if(solutie[k] == solutie[j]) {
                    q = 1;
                    break;
                }
            }
            if(q) backtrack(k+1);
        }
    }
}

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

    scanf("%d", &N);

    backtrack(1);
    return 0;
}