#include <bits/stdc++.h>

using namespace std;

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

int v[10], n, f[10];

void bkt( int k ) {
    int j, i;
    if( k >= n + 1 ) {
        for( j = 1; j <= n; j++ )
            fout << v[j] << ' ';
        fout << '\n';
    } else {
        for( i = 1; i <= n; i++ ) {
            if( !f[i] ) {
                f[i] = 1;
                v[k] = i;
                bkt( k + 1 );
                f[i] = 0;
            }
        }
    }
}

int main() {
    fin >> n;
    bkt(1);
    return 0;
}