#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, a[9], bif[9];
void back(int r)
{
    if (r == n + 1)
    {
        for (int i = 1; i <= n; i++)
            g << a[i] << " ";
        g << '\n';
        return;
    }
    for (int i = 1; i <= n; i++)
        if (!bif[i])
            bif[i] = 1,
            a[r] = i, back(r + 1), bif[i] = 0;
}
int main()
{
    f >> n;
    back(1);
    return 0;
}