#include <bits/stdc++.h>

#define MAXN 8

using namespace std;

bool frq[MAXN+1];
int stk[MAXN+1], n;

void bkt(int level)
{
    int i;
    if(level == n+1) {
        for(i=1; i<=n; ++i)
            printf("%d ", stk[i]);
        printf("\n");
        return;
    }

    for(i=1; i<=n; ++i)
        if(!frq[i]) {
            frq[i] = 1;
            stk[level] = i;
            bkt(level+1);
            frq[i] = 0;
        }
}

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

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

    return 0;
}