#include <fstream>
#include <algorithm>

using namespace std;
const int nmax=2000001;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
short n,v[9],i;
int main()
{
    fin>>n;
    for(i=1;i<=n;++i)v[i]=i;
    do
    {
        for(i=1;i<=n;++i)
            fout<<v[i]<<' ';
        fout<<'\n';
    }while(next_permutation(v+1,v+n+1));
    return 0;
}