#include<stdio.h>
char c[10],sol[20],n;
int nn;
void back(int k){
	if(k==nn+2){
		sol[nn+1]=0;
		puts(sol);
		return;
	}
	for(char i='1';i!=n+1;++i)
		if(c[i-'0']==0){
			c[i-'0']=1;
			sol[k]=i;
			sol[k+1]=' ';
			back(k+2);
			c[i-'0']=0;
		}
}
int main(){
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%c\n",&n);
	nn=n-'0';
	nn=2*(nn-1);
	back(0);
	return 0;
}