#include <stdio.h>
int n,v[9];


bool jo(int k){
int i;

for(i=1;i<=k-1;i++){if(v[i]==v[k]){return false;}}

return true;

}


void kiir(){
int i;

for(i=1;i<=n;i++){printf("%d ",v[i]);}
printf("\n");


}


void back(int k){
int i;

for(i=1;i<=n;i++){

v[k]=i;

if(jo(k)){if(k==n){kiir();}else{back(k+1);}}


}

}


int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);

scanf("%d",&n);

back(1);


	return 0;}