#include <bits/stdc++.h>
#define link pair<int, int>
#define x first
#define y second

using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n;
int perm[10];

void back(int k)
{
  if(k == n + 1)
  {
    for(int i = 1;i <= n;++i)
      g<<perm[i]<<" ";
    g<<'\n'; 
    return;
  }
  
  for(int i = 1;i <= n;++i)
  {
    bool found = false;
    for(int j = 1;j < k;++j)   
      if(perm[j] == i)
        {
          found = true;
          break;
        }
    if(!found)
      {
        perm[k] = i;
        back(k + 1);
      }
  }
}


int main()
{
  f>>n;
  back(1);
  return 0;
}