#include <cstdio> 
#include <algorithm> 

using namespace std;

const int N = 10;

int n;
int sir[N];

void citire()
{
	scanf("%d", &n);

	for(int i = 0; i < n; i++)
	{
		sir[i] = i + 1;
	}
}

void afisare()
{
	for(int i = 0; i < n; i++)
	{
		printf("%d ", sir[i]);
	}

	printf("\n");
}

void solve()
{
	afisare();

	while(next_permutation(sir, sir + n) == true)
	{
		afisare();
	}
}

int main()
{
	freopen("permutari.in", "r", stdin);
	freopen("permutari.out", "w", stdout);

	citire();
	solve();

	return 0;
}