#include<bits/stdc++.h>
using namespace std;
int n,v[100];
void dfs(int step,string s){
	if(step>n){
		cout<<s<<endl;
		return;
	}
	for(int i=1;i<=n;i++){
		if(v[i]==0){
		v[i]=1;
		dfs(step+1,s+char(i+'0')+" ");
		v[i]=0;	
		}
	}
}
int main(){
	cin>>n;
	dfs(1,"");
	return 0;
} 
/**************************************************************
	Problem: 1308
	User: lujiaye
	Language: C++
	Result: Accepted
	Time:51 ms
	Memory:2076 kb
****************************************************************/