#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, k, x[100], viz[100];
void back(int k) {
	int i;
	if (k == n+1) {
		for (i = 1; i <= n; i++) fout << x[i] << " ";
		fout  << endl;
	}
	else {
		for (i = 1; i <= n; i++) {
			if (viz[i] == 0) {
				viz[i] = 1;
				x[k] = i;
				back(k + 1);
				viz[i] = 0;
			}
		}
	}
}


int main() {
	fin >> n;
	back(1);
	//system("pause");
	return 0;
}