#include<iostream>
#include<fstream>
#define nmax 100
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n , k , x[nmax] , uz[nmax] ;
void retsol ()
{
    for (int i=1;i<=n;i++)
     fout<<" "<<x[i];
    fout<<endl;
}
void back (int k)
{
    if (k-1==n)
     retsol();
    else
     for (int i=1;i<=n;i++)
          if (!uz[i])
      {
          x[k]=i;
          uz[i]=1;
          back(k+1);
          uz[i]=0;
      }
}
int main ()
{
    fin>>n;
    back(1);
    return 0;
}