#include <bits/stdc++.h>
#define MAXN 8

using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

int n, solve[MAXN];
bitset<MAXN + 1> fr;
void show() {
    for (int i = 0; i < n; i++)
        fout << solve[i] << ' ';
    fout << '\n';
}

void back(int k = 0) {
    if (k == n) {
        show();
        return;
    }

    for (int i = 1; i <= n; i++)
        if (!fr[i]) {
            fr[i] = 1;
            solve[k] = i;
            back(k + 1);
            fr[i] = 0;
        }
}

int main() {
    fin >> n;
    back();
    return 0;
}