#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n;
vector<int> v;

void prep () {
	int i;
	freopen ("permutari.in", "r", stdin);
	scanf ("%d", &n);
	fclose (stdin);
	for (i=1; i<=n; ++i) 
		v.push_back(i);
}

void solve () {
	freopen ("permutari.out", "w", stdout);
	int i;
	do {
		for (i=1; i<=n; ++i)
			printf ("%d ", v[i]);
		printf ("\n");
	} while ( next_permutation ( v.begin(), v.end() ) );
	fclose (stdout);
}

int main () {
	prep ();
	solve ();
	return 0;
}