#include<fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int NMAX=20;
int n,i;
bool f[1+NMAX];
int sir[1+NMAX];
 
void back(int poz) {
  if (poz == n + 1) {
    for (i = 1; i <= n; ++i)
      fout<<sir[i]<<" ";
    fout<<"\n";
  } else {
    for (i = 1; i <= n; ++i) {
      if (f[i] == false) {
        f[i] = true;
        sir[poz] = i;
        back(poz + 1);
        f[i] = false;
      }
    }
  }
}
 
 
int main()
{
    fin>>n;
    back(1);
    return 0;
}