#include<bits/stdc++.h>
using namespace std;
int ans[10],n;
bool vis[10];
void dfs(int deep) {
    if (deep == n+1) {
        for (int i = 1;i <= n;i++) {
            cout << "    " << ans[i];
        }
        cout << endl;
        return;
    }
    else {
        for (int i = 1;i <= n;i++) {
            if (vis[i] == true) continue;
            vis[i] = true;
            ans[deep] = i;
            dfs(deep + 1);
            vis[i] = false;
        }
    }
}
int main() {
    cin >> n;
    dfs(1);
    return 0;
}