#include <cstdio>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;

int n;
vector<int> v;

bool valid(void)
{
	return true;
}
int main(void)
{
	freopen("permutari.in", "r", stdin);
	freopen("permutari.out", "w", stdout);
	
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		v.push_back(i);
	
	do {
		if(valid())
		{
			for (int i = 0; i < n; ++i)
				printf("%d ", v[i]);
			printf("\n");
		}	
	} while (next_permutation(v.begin(), v.end()));
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;

}