#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 10;
int n;
int st[N];
bool use[N];
void bfs(int u)
{
if(u > n)
{
for(int i = 1; i <= n; i ++ ) cout << st[i] <<' ';
puts(" "); //运行时间比cout << endl短
return ;
}
for(int i = 1; i <= n; i ++ )
{
if(!use[i])
{
st[u] = i;
use[i] = true;
bfs(u + 1);
use[i] = false;
st[u] = 0;
}
}
}
int main()
{
cin >> n;
bfs(1);
return 0;
}