#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string.h>
using namespace std;
int i,n,v[100],use[100],j;
void sol(){
	for(j=1;j<=n;++j){
		printf("%d ",v[j]);
	}
	printf("\n");
}
void back(int k){
	if(k==n+1){
		sol();
		return;
	}
	else{
		for(int i=1;i<=n;++i){
			if(!use[i]){
				v[k]=i;
				use[i]=1;
				back(k+1);
				use[i]=0;
			}
		}
	}
	return;
}
int main(){
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
	back(1);
	return 0;
}