md

#include<iostream>
short n,a[10];bool f[11];
void dfs(short x=0){
    if(x==n){
        for(int i=0;i<n;++i)::std::cout<<a[i]<<' ';
        ::std::cout<<'\n';
        return;
    }
    for(int i=1;i<=n;++i){
        if(f[i])continue;
        a[x]=i,f[i]=1;
        dfs(x+1);
        f[i] ^= f[i];
    }
}
int main(){
    ::std::ios::sync_with_stdio(-0);
    ::std::cin>>n;
    dfs();
    return 0;
}