#include <fstream>
using namespace std;

ifstream in ("permutari.in");
ofstream out ("permutari.out");

int t[10], n, p, i, c, k = 1;

int main()
{
  in >> n;
  t[k] = 0;
  while (k){
    do{
      if (t[k] < n){
        p ++;
        t[k] ++;
      } else p = 0;
      if (p){
        c = 0;
        for (i = 1; i < k; i ++){
          if (t[i] == t[k])
            c ++;
          if (c) break;
        }
      }
    } while (p != 0 && c != 0);
  if (p != 0 && k == n){
    for (i = 1; i <= n; i ++)
       out << t[i] << " ";
    out << endl;
  } else
  if (p != 0 && k < n){
    k ++;
    t[k] = 0;
  } else
  if (p == 0) k --;
  }
  return 0;
}