#include<cstdio>
using namespace std;
int frq[10], st[10], n;
int bkt(int lev){
    if(lev == n + 1){
        for(int i = 1; i <= n; i++)
            printf("%d ", st[i]);
        printf("\n");
    }
    for(int i = 1; i <= n; i++){
        if(!frq[i]){
            frq[i] = 1;
            st[lev] = i;
            bkt(lev + 1);
            frq[i] = 0;
        }
    }
}


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