#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <bitset>

using namespace std;
#define oo 0x3f3f3f3f
#define cost first 
#define ngh second 

ifstream f("permutari.in");
ofstream g("permutari.out");
int n, arr[10];

void generate(int nr) {
  if(nr == n) {
    for(int i = 1;i <= n;++i) {
      g<<arr[i]<<" ";
    }
    g<<'\n';
    return;
  }

  for(int i = 1;i <= n;++i) {
    bool exists = false;
    for(int j = 1;j <= nr;++j) {
      if(arr[j] == i) {
        exists = true;
        break;
      }
    }
    if(exists) {
      continue;
    }
    arr[nr + 1] = i;
    generate(nr + 1);
  }
}

void solve() {
  f>>n;
  generate(0);
}

int main() {
  solve();
  return 0;
}