#include<fstream>
using namespace std;

int a[100],b[1000],n;;

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

void back(int k)
{
    if(k-1==n)   //afisam solutia
    {
        for(int i = 1; i <=n;i++)
        g<<a[i]<<' ';
        g<<"\n";
    }
    else
    {
        for(int  i = 1; i <=n; i++)
        if(!b[i])  //daca valoarea nu-i folosita
        {
            a[k] = i;
            b[i] = 1; //o folosim
            back(k+1); //trecem la pasul urmator
            b[i] = 0; //o eliberam
        }
    }
}

int main()
{

    f>>n;
    back(1);
    f.close(); g.close();
    return 0;
}