/*
permutari infoarena-generare toate permutari cu next permutation din algorithm
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>

using namespace std;

#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second

#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))

#define IN_FILE "permutari.in"
#define OUT_FILE "permutari.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);

//variables
int n;
VI x;
//other functions
void reading()
{
	f >> n;
	f.close();
}
void solving()
{
	x.push_back(0);
	FOR(i, 1, n)
	{
		x.push_back(i);
	}
	do
	{
		FOR(i, 1, n)
		{
			g << x[i] << " ";
		}
		g << "\n";
	} while (std::next_permutation(x.begin()+1, x.end()));
}
void write_data()
{
}
int main()
{
	reading();
	solving();
	write_data();
}