#include<stdio.h>
int a[10],b[10],i,j,n;

void back(int k,int len){
    if(k-1 == len){
        for(i = 1; i <= len;i++)
          printf("%d ",a[i]);
        printf("\n");
    }
    else{
        for(int  i = 1; i <= len; i++)
           if(!b[i]){
			   a[k] = i;
			   b[i] = 1;
               back(k+1,len); 
			   b[i] = 0;
		   }
    }
}

int main(){
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
	back(1,n);
	return(0);
}