#include <stdio.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <unordered_map>
using namespace std;
int8_t hashes[150], n, sols[150], checker;
uint32_t total;

void generateSolutions(int8_t k) {
  if(n == k) {
    total++;
    for(int8_t i = 0; i < n; i++) {
      cout << (uint32_t)sols[i] + 1 << " ";
    }
    cout << "\n";
    return ;
  }
  for(int8_t i = 0; i < n; i++) {
    if(!hashes[i]) {
      hashes[i] = 1;
      sols[k] = i;
      generateSolutions(k + 1);
      hashes[i] = 0;
    }
  }
}

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