#include <cstdio>
using namespace std;
int n, sol[10], uz[10];
void bkt(int k){
    if(k==n+1){
        for(int i=1; i<=n; i++)
            printf("%d ", sol[i]);
        printf("\n");
    }
    else{
        for(int i=1; i<=n; i++)
        if(!uz[i]){
            sol[k] = i;
            uz[i] = 1;
            bkt(k+1);
            uz[i] = 0;
        }
    }
}
int main()
{
    freopen("permutari.in", "r", stdin);
    freopen("permutari.out", "w", stdout);
    scanf("%d", &n);
    bkt(1);
    return 0;
}