#include <fstream>

using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

const int nmax= 8;

int n;

int v[nmax+1];
bool u[nmax+1];

void back( int x )
{
    if ( x==n+1 ) {
        for ( int i= 1; i<=n; ++i ) {
            fout<<v[i]<<" ";
        }
        fout<<"\n";
    } else {
        for ( int i= 1; i<=n; ++i ) {
            if ( u[i]==0 ) {
                u[i]= 1;
                v[x]= i;

                back(x+1);

                u[i]= 0;
            }
        }
    }
}

int main (  )
{
    fin>>n;

    back(1);

    return 0;
}