#include<iostream>
#include<fstream>
using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");
#define nmax 8
int a[nmax], n;
int cond(int k)
{
	for (int i = 1; i < k;i++)
	if (a[i] == a[k])return 0;
	return 1;
}
void bck(int k)
{
	if (n+1 == k)
	{
		for (int i = 1; i <= n; i++)
			fout << a[i] << " ";
		fout << endl;
	}
	else
	for (int i = 1; i <= n; i++)
	{
		a[k] = i;
		if (cond(k))
			bck(k + 1);
	}
}


int main() 
{
	fin >> n;
	bck(1);

	return 0;
}