#include <bits/stdc++.h>

using namespace std;

const int NMAX = 15;

int n, ans[NMAX + 1];
bool used[NMAX + 1];

inline void afis() {
    for(int i = 1; i <= n; ++i) printf("%d ", ans[i]);
    printf("\n");
}

inline void bt(const int X = 1) {
    for(int i = 1; i <= n; ++i)
        if(!used[i]) {
            ans[X] = i;
            used[i] = 1;
            if(X == n) afis();
            else bt(X + 1);
            used[i] = 0;
        }
}

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