#include <bits/stdc++.h>
using namespace std;
int a[100], b[100], c[100], d[100], tot, n;
int print (){
    if (tot < 3){
        for (int i = 1; i <= n; i ++)
        cout << a[i] << " ";
        cout << endl;
        }
        tot ++;
}
void search(int k) {
    if (n < k){
        print ();
        return ;
    }
    else{
        for (int i = 1; i <= n; i ++){
            if((!b[i]) && (!c[k + i]) && (!d[k - i + n])){
                a[k] = i;
                b[i] = 1;
                c[k + i] = 1;
                d[k - i + n] = 1;
                search (k + 1);
                b[i] = 0;
                c[k + i] = 0;
                d[k - i + n] = 0;
            }
        }
    }
}
signed mian() {
    cin >> n;
    search (1);
    cout << tot;
    return 0;
}