/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/
 
#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define inf 1<<30
#define eps 1.e-10
#define N 200
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,sol,v[N];
bool viz[N];
void back(int k)
{
	if(k>n)
	{
		FOR(i,1,n)
		g<<v[i]<<" ";
		g<<"\n";
		return ;
	}
	FOR(i,1,n)
	{
		v[k]=i;
		if(viz[i])
			continue;
		viz[i]=1;
		back(k+1);
		viz[i]=0;
	}
}
int main ()
{
	f>>n;
	back(1);
    return 0;
}