#include <bits/stdc++.h>

using namespace std;

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

int n, s[100], u[100];

int afisare()
{
    for(int i = 1; i <= n; i++)
        g << s[i] << " ";
        g << endl;
}

int valid(int k)
{
    for(int i = 1; i <= n; i++)
        if(s[k] == s[i])
        return 0;
    return 1;
}

int bkt(int k)
{
    if(k - 1 == n)
        afisare();
    else

    for(int i = 1; i <= n; i++)
    {
        s[k] = i;

       /*if(i == n && k == n)
            afisare();*/

        if(u[i] == 0)
        {
            u[i] = 1;
            bkt(k + 1);
            u[i] = 0;
        }
    }
}

int main()
{
    f >> n;
    bkt(1);
    return 0;
}