#include<bits/stdc++.h>

using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int a[25], n, v[25];
// v[i] = 1 daca i este deja pus in a[]
void Afis()
{
	for (int i = 1; i <= n; i++)
		fout << a[i] << " ";
	fout << "\n";
}

void Back(int top)
{
	if (top == n + 1) Afis();
	else for (int i = 1; i <= n; i++)
		if (v[i] == 0) // i nu este inca in a[]
		{
			a[top] = i;
			v[i] = 1;
			Back(top + 1);
			v[i] = 0;
}
}

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