#include <fstream>

using namespace std;

ifstream in("permutari.in");
ofstream out("permutari.out");

const int MAXN = 8;

int sol[MAXN + 1];
int n;

void bck(int k) {
	if (k > n) {
		for (int i = 1; i <= n; ++ i) out << sol[i] << ' ';
		out << '\n';
	} else {
		for (int i = 1; i <= n; ++ i) {
			bool ok = 1;
			for (int j = 1; j < k && ok; ++ j)
				if (sol[j] == i)
					ok = false;
			if (ok) {
				sol[k] = i;
				bck(k + 1);
			}
		}
	}
}

int main() {
	in >> n;
	bck(1);

	return 0;
}