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

using namespace std;

void solve()
{
	int n;
	fstream f("permutari.in", ios::in);
	f>>n;
	vector< int > v;
	v.reserve(n);
	v.resize(n);
	fstream g("permutari.out", ios::out);
	for (int i=0; i < n; ++i)
	{
		v[i]=i+1;
		g<<i+1<<" ";
	}
	g<<"\n";
	while (next_permutation(v.begin(), v.end()))
	{
		for (vector<int>::iterator it=v.begin(); it < v.end(); it++)
			g<<*it<<" ";
		g<<"\n";
	}
	g.close();
};

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