#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("permutari.in"); ofstream g("permutari.out");
int n,w=1,i,j,p[9];
int main()
{	f>>n;
	for(i=1;i<=n;i++) p[i]=i;
	while(w)
	{	for(i=1;i<=n;i++) g<<p[i]<<" ";
		g<<"\n";
		i=n-1;
		while(1<=i && p[i]>p[i+1]) i--;
		w=i;
		if(w) 
		{	j=n; 
			while(p[j]<=p[i]) j--;
			p[i]^=p[j]^=p[i]^=p[j];
			reverse(p+i+1,p+n+1);
		}
	}
	g.close();
	return 0;
}