#include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <queue>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <iomanip>
#include <stack>
#include <climits>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

int n, st[20];
bitset<20> ap;

void Write()
{
	for (int i = 1; i <= n; i++)
		fout << st[i] << " ";
	fout << "\n";
}

void Back(int top)
{
	if (top > n) Write();
	else for(int i = 1; i <= n; i++)
		if (!ap[i])
		{
			ap[i] = true;
			st[top] = i;
			Back(top + 1);
			ap[i] = false;
		}
}

int main()
{
	fin >> n;
	Back(1);
	return 0;
}