cin>>3
1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

#include <iostream>
//#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <vector>
#include <deque>
using namespace std;
typedef long long ll;
//const int N = 2e5 + 10;
//int a[N], b[N];
//int aa[200], bb[200];
int n;
int arr[20];
bool a[20];
void dfs(int x)
{
    if (x > n)
    {
        for (int i = 1; i <= n; i++) cout <<"    " << arr[i];
        cout << endl;
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        if (a[i] != true)
        {
            a[i] = true;
            arr[x] = i;
            dfs(x + 1);
            a[i] = false;
            arr[x] = 0;
        }
    }
}
int main()
{
    cin >> n;
    dfs(1);
    return 0;
}