#include <cstdio>
#include <cstring>
using namespace std;
int p[10],uz[10],n;

void back(int k)
{ int i;
 if (k==n) {
			for (i=1;i<=n;++i)
			 printf("%d ",p[i]);
			printf("\n");
		   }
	else
	{
	  for (i=1;i<=n;++i)	
	   if (!uz[i])
		{
			uz[i]=1;
			p[k+1]=i;
			back(k+1);
			uz[i]=0;
	    }
	}	
}

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