#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 N;
vector<char> v;

void ReadData()
{
	ifstream f(fin);
	
	f >> N;
	for ( int i = 1; i <= N; ++i )
		v.pb(i+'0');

	f.close();
}

void Solve()
{
	ofstream f(fout);
	
	do
	{
		for ( int i = 0; i < N; ++i )
			f << v[i] << ' ';
		f << endl;
	} while ( next_permutation(v.begin(),v.end()) );

	f.close();
}

int main()
{
	ReadData();
	Solve();
	return 0;
}