#include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 10;
int path[maxn];
bool vis[maxn];
void dfs(int u)
{
if (n == u)
{
for (int i = 0; i < n; i ++)
{
cout << path[i] << ' ';
}
cout << endl;
return;
}
for (int i = 1; i <= n; i ++)
{
if (! vis[i])
{
path[u] = i;
vis[i] = true;
dfs (u + 1);
path[u] = 0;
vis[i] = false;
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
dfs(0);
return 0;
}
07-24
2304
02-27
07-18
1767
10-05
785
10-19
4431
12-29
2269
01-17