#include<iostream>
#include<fstream>
using namespace std;

int n,viz[10],perm[10];
ifstream fin("permutari.in");
ofstream fout("permutari.out");

void back (int k) {
	if (k == n+1) {
		for (int i=1;i<=n;i++)
			fout<<perm[i]<<' ';
		fout<<'\n';
		return;
	}
	for (int i=1;i<=n;i++)
		if (viz[i]==0){ //pt fiecare nivel punem fiecare nr disponibil, in ordine
			viz[i]=1;
			perm[k]=i;
			back(k+1);
			viz[i]=0;
		}
}

int main () {
	fin>>n;
	back(1);
	fin.close();
	fout.close();
}