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

using namespace std;

int v[20], n, viz[20];
ifstream in("permutari.in");
ofstream out("permutari.out");

void backtr(int poz)
{
    if(poz == n+1)
    {
        for(int i = 1; i <= n; i++)
            out << v[i] << " ";
        out << "\n";
        return;
    }
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            v[poz] = i;
            viz[i] = 1;
            backtr(poz+1);
            viz[i] = 0;
        }
    }
}

int main()
{
    ifstream in("permutari.in");
    in >> n;
    backtr(1);
    return 0;
}