#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
int f[9],n;
bitset <10> v;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void bkt(int k)
{

    if(k>n){for(int i=1;i<=n;++i)fout<<f[i]<<" ";fout<<"\n";}
    else
    {

        for(int i=1;i<=n;++i)
             if(v[i]==1)
        {
            f[k]=i;
            v[i]=0;
            bkt(k+1);
            v[i]=1;
        }
    }
}
int main()
{
    fin>>n;
    for(int i=1;i<=n;++i)v[i]=1;
    bkt(1);
    return 0;
}