#include <bits/stdc++.h>

using namespace std;

int n;

void bkt(vector <int> &perm, vector <bool> &marked) {
    if ((int)perm.size() == n) {
        for (int x : perm)
            cout << x << ' ';
        cout << '\n';
        return;
    }

    for (int i = 1; i <= n; ++i)
        if (!marked[i]) {
            marked[i] = true;
            perm.push_back(i);
            bkt(perm, marked);
            perm.pop_back();
            marked[i] = false;
        }
}

void solve() {
    cin >> n;
    vector <int> perm;
    vector <bool> marked (n, false);
    bkt(perm, marked);
}

int main() {

    // #ifndef ONLINE_JUDGE
    freopen("permutari.in", "r", stdin);
    freopen("permutari.out", "w", stdout);
    // #endif

    int t = 1;
    // cin >> t;

    while (t--)
        solve();

    return 0;
}