#include <cstdio>
int x[10],b[10],n;

void next_permutation(int p){
    for(int i=x[p]+1;i<=n;i++)
    if(!b[i]){
        b[x[p]]=0;
        b[i]=1;
        x[p]=i;
        return ;}
    b[x[p]]=0;
    x[p]=0;
    next_permutation(p-1);
    for(int i=1;i<=n;i++)
    if(!b[i]){
        b[i]=1;
        x[p]=i;
        return ; }
}

int main(){
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
        scanf("%d",&n);
    for(int i=1;i<=n;i++)x[i]=i,b[i]=1;
    do{ for(int j=1;j<=n;j++)printf("%d ",x[j]); printf("\n");
        next_permutation(n);
    }while(x[0]==0);
}