#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");

void back_permutari(int k, int n, vector <int> viz, vector <int> v)
{
    if (k == n + 1)
    {
        for (int i = 1; i <= n; i++)
            g << v[i] << " ";
        g << "\n";
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
        {
            viz[i] = 1; v[k] = i;
            back_permutari(k + 1, n, viz, v);
            viz[i] = 0;
        }
    }

}

int main()
{
    int n;

    f >> n;
    vector <int> viz(n+1);
    vector <int> v(n+1);

    back_permutari(1, n, viz, v);

    return 0;
}