#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,S[9];

void back(int k)
{
    int i,j,t;

    if(k==n)
    {
        for(i=1;i<=n;i++)
            g<<S[i]<<" ";
            g<<endl;
    }
    else
        for(i=1;i<=n;i++){
        S[k+1]=i;
        t=1;
        for(j=1;j<=k;j++)
            if(S[j]==S[k+1]) { t=0; break;}
            if(t==1) back(k+1);
        }




}



int main()
{f>>n;
back(0);


    return 0;
}