#include <iostream>
#include <fstream>
using namespace std;
/// Varianta recursiva
ifstream f("permutari.in");
ofstream g("permutari.out");

int n, s[10], F[10];

void afis()
{
    for(int i = 1; i <= n; i++)
        g << s[i] << ' ';
    g << '\n';
}

void bkt(int k)
{
    if(k <= n)
        for(int i = 1; i <= n; i++)
        {
            if(F[i] == 0)
            {
                s[k] = i;
                F[i] = 1;
                bkt(k + 1);
                F[i] = 0;
            }
        }
    else afis();
}

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