#include <fstream>
#include <cmath>
using namespace std;

ifstream in("regine.in");
ofstream out("regine.out");

int n, x[101], nrsol = 0;
bool ln[20], cl[20], dg1[20], dg2[20];

void afis()
{
    for(int i = 1; i <= n; i++)
        out << x[i] << ' ';
    out << '\n';
}

int valid(int l, int c)
{
    if(ln[l] || cl[c] || dg1[l - c + n] || dg2[l + c + 1])return 0;
    return 1;
}

void backt(int k)
{
    for(int i = 1; i <= n; i++)
    {
        x[k] = i;
        if(valid(k, i))
        {
            ln[k] = cl[i] = dg1[k - i + n] = dg2[k + i + 1] = 1;
            if(k == n)
            {
                nrsol++;
                if(nrsol <= 3)
                    afis();
            }
            else
                backt(k + 1); //avansare
            ln[k] = cl[i] = dg1[k - i + n] = dg2[k + i + 1] = 0;
        }
    }
}

int main()
{
    in >> n;
    backt(1);
    out << nrsol;
    return 0;
}