#include <bits/stdc++.h>
using namespace std;

const int Nmax = 20;

int n;

vector<int> perm;
bool vis[Nmax];

void search(){
	if(perm.size() == n){
		for(int i = 0; i < n; i++) cout << perm[i] << " ";
		cout << endl;
	}
	else{
		for(int i = 1; i <= n; i++){
			if(vis[i]) continue;
			vis[i] = true;
			perm.push_back(i); 
			search();
			vis[i] = false;
			perm.pop_back(); 
		}
	}
}

int main(){
	cin >> n;
	search();
}