#include <cstdio>
using namespace std;

int ad[10];
int v[10];

void backa( int n, int niv ){

    int i;

    if( niv > n ){
        for( i = 1; i <= n; ++i ) printf("%d ",v[i]);
        printf("\n");
        return ;
    }

    for( i = 1; i <= n; ++i ){
        if( !ad[i] ){
            v[niv] = i;
            ad[i] = 1;
            backa(n,niv+1);
            ad[i] = 0;
        }
    }

}

int main()
{

    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);

    int n;

    scanf("%d",&n);
    backa( n, 1 );



    return 0;
}