#include <bits/stdc++.h>
using namespace std;

int N, permutation[10], status[10];

void Back(int level){
    if(level == N + 1){
        for(int i = 1; i <= N; i++) printf("%d ", permutation[i]);
        printf("\n");
    }else{
        for(int i = 1;i <= N; i++){
            if(status[i] == 0){
                permutation[level] = i;
                status[i] = 1;
                Back(level + 1);
                status[i] = 0;
            }
        }
    }
}

int main(){

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

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

return 0;
}