#include <iostream>
#include <fstream>

using namespace std;

double n;
int v[9];

ifstream f("permutari.in");
ofstream g("permutari.out");

void print()
{
	for (int i = 1; i <= n; i++)
		g << v[i];
	g << "\n";
}

int valid(int k)
{
	for (int i = 1; i <= k - 1; i++)
		if (v[k] == v[i])
			return 0;
	return 1;
}

void back(int k)
{
	for (v[k] = 1; v[k] <= n; v[k]++)
		if (valid(k))
			if (k == n)
				print();
			else
				back(k + 1);
}

int main()
{
	f >> n;
	back(1);
	f.close();
	g.close();
	exit(0);
}