#include<cstdio>
#include<vector>
#include<queue>

#define N 9

using namespace std;

int n;
bool used[N];
int val[N];

void back(int pas)
{
	if(pas==n)
	{
		for(int k=0;k<n;++k)
			printf("%d ",val[k]);
		printf("\n");
		return;
	}
	for(int i=1;i<=n;i++)
		if(!used[i])
		{
		used[i]=1;
		val[pas]=i;
		back(pas+1);
		used[i]=0;
		}
}

int main()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	
	scanf("%d",&n);
	back(0);
	
	return 0;
}