#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int NMAX = 10;
int v[NMAX];

int main()
{
	int n;
	fin >> n;
	for (int i = 1; i <= n; i++)
		v[i] = i;
	for (int i = 1; i <= n; i++)
		fout << v[i] << " ";
	fout << "\n";
	while (next_permutation(v + 1, v + n + 1))
	{
		for (int i = 1; i <= n; i++)
			fout << v[i] << " ";
		fout << "\n";
	}
	return 0;
}