#include <stdio.h>
      #include <algorithm>
      using namespace std;
      main()
      {
          FILE *f=fopen("permutari.in","r"), *g=fopen("permutari.out","w");
          int n,i,a[10];
          fscanf(f,"%d",&n);
           for(i=1;i<=n;i++)
              a[i]=i;
          do
          {
                  for ( int i = 0 ; i <n-1 ; i++ )
                      fprintf(g,"%d ",a[i]);
                  fprintf(g,"%d\n",a[n-1]);                  
          } while ( next_permutation( a, a + n ) );
          return 0;
      }