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

using namespace std;

#define mp make_pair
#define pb push_back
#define sz(c) (int)((c).size())
#define f first
#define s second

#define fin  "permutari.in"
#define fout "permutari.out"

int main()
{
	int N;
	vector<char> v;

	ifstream f(fin);	
	ofstream f2(fout);

	f >> N;
	for ( int i = 1; i <= N; ++i )
		v.pb(i+'0');

	do
	{
		for ( int i = 0; i < N; ++i )
			f2 << v[i] << ' ';
		f2 << '\n';
	} while ( next_permutation(v.begin(),v.end()) );

	return 0;
}