#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,v[10],fol[10];
void permut(int p){
    if(p>n)
        {
        for(int i=1;i<=n;++i)
            fout<<v[i]<<" ";
        fout<<endl;
        return;
        }
    for(int i=1;i<=n;++i)
        if(fol[i]==0)
            {fol[i]=1;
    v[p]=i;
    permut(p+1);
    fol[i]=0;}

}

int main()
{

    fin>>n;
    permut(1);
    return 0;
}