#include <fstream>

using namespace std;

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

int n, u[16], p[16];

void back(int k)
{
    int i;
    if(k == n + 1)
    {
        for(i = 1; i <= n; ++i)
        {
            g << p[i] << " ";
        }
        g << '\n';
        return;
    }
    for(i = 1; i <= n; ++i)
    {
        if(!u[i])
        {
            u[i]=1;
            p[k]=i;
            back(k+1);
            u[i]=0;
        }
    }
}

int main()
{
    f >> n;
    back(1);
    g.close();
}