#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;

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

int n, k, a[10],b[10],i,j;

void BKT(int k)
{
    if(k==n)
    {
        for(i=1;i<=n;i++)
            cout<<a[i]<<" ";
        cout<<endl;
    }
    else
    {
        for(i=1;i<=n;i++)
        {
            if(b[i]==0){
                b[i]=1;
            a[k]=i;
            BKT(k+1);
            b[i]=0;
        }
    }
}
}

int main()
{
    cin >> n;
    BKT(1);
    return 0;
}