#include<stdio.h>

int n,k,x[10],i;

int cont ( int p){

int i;

  for(i=1;i<p;i++){
    if(x[i]==x[p])return 0;
  }


return 1;
}





int main(){

FILE *f=fopen("permutari.in","r");

fscanf(f,"%d",&n);

fclose(f);

FILE *g=fopen("permutari.out","w");

 k=1;
 x[1]=0;


 while(k!=0){

    if(x[k]<n){
     x[k]++;

       if(cont(k)){

	 if(k==n){

	  for(i=1;i<=n;i++){
	  fprintf(g,"%d ",x[i]);
	  }
	 fprintf(g,"\n");
	 }

	 else{
	 k++;
	 x[k]=0;
	 }



       }


    }

    else k--;

 }


fclose(g);


return 0;
}