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

using namespace std;

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

vector <int> x;

int main()
{
    int N;
    fin >>N;

    for (int i = 1; i <= N; ++i)
		x.push_back(i);

	do
	{
		for (int i = 0; i < N; ++i)
			fout <<x[i] <<' ';
		fout <<'\n';
	}
	while (next_permutation(x.begin(), x.end()));

    return 0;
}