#include <bits/stdc++.h>

using namespace std;

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

int n, a[10], sol[10], k;

void Perm_Backk(int k)
{
    if(k > n)
    {
        for(int i = 1; i <= n; i++)
            g << sol[i] << " ";
        g << "\n";
        return;
    }
    for(int i = 1; i <= n; i++)
    {
        if(a[i] == 0)
        {
            a[i] = 1;
            sol[k] = i;
            Perm_Backk(k + 1);
            a[i] = 0;
        }
    }
}

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