#include <cstdio>
#include <algorithm>
using namespace std;

int N, x[200];

void perm (const int &i) {

    if (i > N) {
        for (int k = 1; k <= N; ++k)
            printf ("%d ", x[k]);
        printf ("\n");
        return;
    }
    for (int k = i; k <= N; ++k) {
        swap (x[i], x[k]);
        perm (i + 1);
        swap (x[i], x[k]);
    }

}

int main () {

    freopen ("permutari.in", "r", stdin);
    freopen ("permutari.out", "w", stdout);
    scanf ("%d", &N);
    for (int k = 1; k <= N; ++k)
        x[k] = k;
    perm (1);

}