#include <cassert>
#include <cstdio>

const int nmax=8;

int n;

bool used[nmax+1];
int v[nmax+1];

void bt(int x){
    if (x==n+1){
        for (int i=1; i<=n; ++i){
            printf("%d ", v[i]);
        }
        printf("\n");
    }else{
        for (int i=1; i<=n; ++i){
            if (!used[i]){
                v[x]=i;used[i]=1;
                bt(x+1);
                used[i]=0;
            }
        }
    }
}

int main(){
    assert(freopen("permutari.in", "r", stdin));
    assert(scanf(" %d ", &n));

    assert(freopen("permutari.out", "w", stdout));
    bt(1);

    return 0;
}