#include<bits/stdc++.h>
using namespace std;

int n, a[101], v[101];

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

void back(int l)
{ 
	for (int i = 1; i <= n; i++)
		if (v[i] == 0)
		{ 
		a[l] = i;
		v[i] = 1;
		if (l != n)
			back(l+1);
		v[i] = 0;
		}
		if (l == n)
	    {
		for (int i = 1; i <= n; i++)
			fout<<a[i]<<' ';
		    fout<<endl;
	    }
}


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