#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
///Complexitate O(n!)
///Metoda:Backtracking(recursiv)
const short nmax=11;
short st[nmax],top,viz[nmax],n;
void Back(int top)
{
    if(top==(n+1))
    {
        for(int i=1;i<=n;i++)
            fout<<st[i]<<" ";
        fout<<"\n";
    }
    else for(int i=1;i<=n;i++)
            if(!viz[i])
    {
        viz[i]=1;
        st[top]=i;
        Back(top+1);
        viz[i]=0;
    }
}
int main()
{
    fin>>n;
    Back(1);
    fin.close();
    fout.close();
    return 0;
}