#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int main()
{
	int a,i,n;
	vector<int>v;
	f>>a;
	while(a>0){v.push_back(a);a--;}
	sort(v.begin(),v.end());n=v.size();
	do
	{
		for(i=0;i<n;i++)
			g<<v[i]<<" ";
		g<<'\n';
	}while(next_permutation(v.begin(),v.end()));
	f.close();g.close();
	return 0;
}