#include <fstream>

using namespace std;

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

int n, a[10];

bool verifica(int d){
  for (int i = d - 1; i >= 1; i--)
    if (a[d] == a[i])
      return false;
  return true;
}

void afisare (){
  for (int i = 1; i <= n; i++)
    fout << a[i] << ' ';
  fout << '\n';
}

void bkt (int d){
  if (d == n + 1)
    afisare();
  else
    for (int i = 1; i <= n; i++){
      a[d] = i;
      if (verifica (d))
        bkt(d + 1);
    }
}

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