#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;

int a[16], n;
int v[16];
/// v[i] = 1, daca i este pus deja in a
/// v[i] = 0, daca i nu e pus in a

void Citire()
{
  ifstream fin ("permutari.in");
  fin>>n;
  fin.close();
}

ofstream fout("permutari.out");

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

void GenPerm(int k)
{
   int i;
   if (k == n+1) Afisare();
   else for (i=1; i <= n; i++)
  		if (v[i] == 0)
		{
			a[k] = i;
			v[i] = 1;
			GenPerm(k+1);
			v[i] = 0;
        }
}

int main ()
{
    Citire();
    GenPerm(1);
    fout.close();
    return 0;
}