/**
Code made by Funny Stocky
**/
#include <fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
int numberofelements,ourvector[8+1],lenghtpermutation;
void backtracking(int lenghtpermutation)
{
    if(lenghtpermutation==numberofelements)
    {
        for(int position=1;position<=numberofelements;position=position+1)
            cout<<ourvector[position]<<" ";
        cout<<"\n";
    }
    if(lenghtpermutation<numberofelements)
    {
        int aparitonvector[8+1];
        for(int position=1;position<=numberofelements;position=position+1)
            aparitonvector[position]=0;
        for(int position=1;position<=lenghtpermutation;position=position+1)
            aparitonvector[ourvector[position]]=1;
        for(int position=1;position<=numberofelements;position=position+1)
        {
            if(aparitonvector[position]==0)
            {
                lenghtpermutation=lenghtpermutation+1;
                ourvector[lenghtpermutation]=position;
                backtracking(lenghtpermutation);
                lenghtpermutation=lenghtpermutation-1;
            }
        }
    }
}
int main()
{
    cin>>numberofelements;
    backtracking(lenghtpermutation);
    return 0;
}