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

using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");

void perm (int n, int y, vector<int> aleg, vector<int> amvazut){
    if (y == n){
        for (int i = 0; i < n; i++)
            out<< aleg[i] << " ";
        out<< "\n";
    }
    else
    {
        for (int i = 1; i <= n; i++){
            bool ok = 0;
            int j = i;

            aleg[y] = i;
            amvazut[i] += 1;
            if (amvazut[i] <= 1)
                perm(n, y + 1, aleg, amvazut);
            amvazut[aleg[y]] -= 1;
        }
    }
}
int main()
{
    int n, y = 0;

    in>> n;
    vector<int> aleg(n, 0);
    vector<int> amvazut(n + 1, 0);

    perm(n, y, aleg, amvazut);
    return 0;
}