#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

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

int n;

int main(){
	fin >> n;
	vector <int> v(n);
	for(int i = 1; i <= n; i++){
		v[i-1] = i;
	}
	do{
		for(int i = 1; i <= n; i++)
			fout << v[i-1] << ' ';
		fout << '\n';
	}while(next_permutation(v.begin(), v.end()));
	return 0;
}