#include <iostream>
#include <fstream>

using namespace std;
const int maxN = 10;
int isIn[maxN];
int n;
int sol[maxN];
  ifstream in;
  ofstream out;



void printSol()
{
  for (int i = 1; i <= n; i++)
  {
    out << sol[i] << " "; 
  }
  out << endl;
}

void perms(int x)
{
  if (x >= n + 1)
  {
    printSol();
    return;
  }
  for (int i  = 1; i <= n; i++)
  {
    if (!isIn[i])
    {
      isIn[i] = 1; 
      sol[x] = i;
      perms(x + 1);
      isIn[i] = 0; 
    }
  }
}
using namespace std;
int main()
{

  in.open("permutari.in");
  out.open("permutari.out");
  in >> n;
  perms(1);
  out.close();
}