#include <cstdio>

using namespace std;

int x[10];
int n;
int f[10];

void back (int k) {
    if (k > n) {
        for (int i=1; i<=n; ++i)
            printf ("%d ", x[i]);
        printf ("\n");
    } else {
        for (int i=1; i<=n; ++i) {
            x[k] = i;
            if (f[i] == 0) {
                f[i] = 1;
                back (k+1);
                f[i] = 0;
            }
        }
    }
}

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

    scanf ("%d", &n);

    back (1);

    return 0;
}