#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;

int n;
vector<int> sir;
vector<bool> vizitat;

void backtrack(int k, ofstream& fout) {
	if (k <= n && k > 0) {
		for (int i = 0; i < sir.size(); i++) {
			fout << sir[i] << " ";
		}
		fout << endl;
	}

	for (int i = 1; i <= n; i++) {
		if (vizitat[i] == false && (k == 0 || sir[k - 1] < i)) {
			vizitat[i] = true;
			sir.push_back(i);
			backtrack(k + 1, fout);
			sir.pop_back();
			vizitat[i] = false;
		}
	}
}

int main() {
	ifstream fin("submultimi.in");
	ofstream fout("submultimi.out");

	fin >> n;
	vizitat.assign(n + 1, false);
	backtrack(0, fout);

	return 0;
}