#include<stdio.h>
#include<algorithm>
using namespace std;
int i,n,f,a[10];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d",&n);
}
void solve()
{
	for(i=1,f=1;i<=n;i++){f*=i;a[i-1]=i;}
	for(;f;f--)
	{
		for(i=0;i<n;i++)printf("%d ",a[i]);printf("\n");
		next_permutation(a,a+n);
	}
}