#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "permutari.in" );
ofstream g ( "permutari.out" );
int v[10], n;
bool afis()
{
    for ( int i = 1; i <= n; i++ )
        g << v[i] << ' ';

    g << '\n';
}
bool valid ( int x )
{
    for ( int i = 1; i < x; i++ )
        if ( v[i] == v[x] )
            return 0;

    return 1;
}
void backt ( int k )
{
    if ( k <= n )
        for ( int i = 1; i <= n; i++ )
        {
            v[k] = i;

            if ( valid ( k ) )
                backt ( k + 1 );
        }
    else
        if ( valid ( k ) )
            afis();
}
int main()
{
    f >> n;
    backt ( 1 );
    return 0;
}