#include<stdio.h>
int n,v[9]; bool oc[9];

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

void solve(int niv){
    if(niv==n+1) tipar();
    else{
        for(int i=1;i<=n;i++)
            if(!oc[i]){
                v[niv]=i;
                oc[i]=1;
                solve(niv+1);
                oc[i]=0;
            }
    }
}

int main(){
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    solve(1);
}