#include <bits/stdc++.h>

using namespace std;

int n,v[10];
bitset <10> Inv;

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

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

    scanf("%d",&n);
    Back(1);

    return 0;
}