#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=100010;
int n,state[N],ans[N];
void dfs(int pos)
{
if(pos==n+1)
{
for (int i=1;i<=n;++i)
{
printf("%d ",ans[i]);
}
puts("");
}
for(int i=1;i<=n;++i)
{
if(state[i]==0)
{
state[i]=1;
ans[pos]=i;
dfs(pos+1);
state[i]=0;
}
}
}
int main(){
scanf("%d",&n);
dfs(1);
return 0;
}