#include <iostream>
#include <cstdio>

using namespace std;

int sol[10] , viz[10] , n ;

void back( int k ) ;

int main()
{
    freopen( "permutari.in" , "r" , stdin ) ;
    freopen( "permutari.out" , "w" , stdout ) ;
    scanf( "%d" , &n ) ;
    back(0) ;
    return 0;
}

void handicapati()
{
    for ( int i = 0 ; i < n ; i ++ )
        printf( "%d " , sol[i] ) ;
    printf( "\n" ) ;
}

void back( int k )
{
    if ( k == n )
    {
        handicapati() ;
        return ;
    }
    for ( int i = 1 ; i <= n ; i ++ )
        if ( not viz[i] )
        {
            sol[k] = i ;
            viz[i] = 1 ;
            back(k+1) ;
            viz[i] = 0 ;
        }
}