#include <stdio.h>

int v[10], n;

int valid(int k){
    int ev = 1;
    if(k > n)
        ev = 0;
    for(int i = 1; i < k; i++)
        if(v[k] == v[i])
            ev = 0;
    return ev;
}

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

int sol(int k){
    if(k == n)
        return 1;
    else
        return 0;
}

void bkt(int k){

    for(v[k] = 1; v[k] <= n; v[k]++){
        if(valid(k))
            if(sol(k))
                afisare();
            else
                bkt(k + 1);
    }
}

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

    scanf("%d", &n);
    bkt(1);
    return 0;
}