#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 8;

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

int v[MAXN+1];
bool marked[MAXN+1];
int n;

void bkt( int poz ) {
  int i;
  if( poz == n + 1 ) {
    for( i = 1; i <= n; i++ )
      fout << v[i] << " ";
    fout << "\n";
  }
  else {
    for( i = 1; i <= n; i++ ) {
      if( !marked[i] ) {
        v[poz] = i;
        marked[i] = true;
        bkt( poz + 1 );
        marked[i] = false;
      }
    }
  }
}
int main() {
  fin >> n;
  bkt( 1 );
  return 0;
}