#include <fstream>
using namespace std;

int use[20], x[20], n;

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

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

void backk(int k)
{
    if(k == n+1)
        show();
    else
    {
        for(int i = 1; i <= n; ++i)
            if(!use[i])
            {
                x[k] = i;
                use[i] = 1;
                backk(k+1);
                use[i] = 0;
            }
    }
}
int main()
{
    f >> n;
    backk(1);
}