#include <cstdio>
#include <bitset>

using namespace std;

int n,sol[10];
bitset <10> viz;

void Back(int pos) {
    if(pos == n) {
        for(int i = 0; i < n; ++i)
            printf("%d ", sol[i]);
        printf("\n");
        return;
    }
    for(int i = 1; i <= n; ++i)
        if(not viz[i]) {
            viz[i] = true;
            sol[pos] = i;
            Back(pos+1);
            viz[i] = false;
        }
}

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

    scanf("%d", &n);

    Back(0);

    return 0;
}