#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, x[14], nrsol = 0;
int col[14], dg1[26], dg2[26];

int valid(int x[], int k)
{
    if((col[x[k]] == 0) && (dg1[k + x[k] - 1] == 0) && (dg2[n - k + x[k]] == 0))
        return 1;
    return 0;
}

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

void backt()
{
    int k = 1;
    x[1] = 0;
    while(k > 0)
        if(x[k] < n)
        {
            x[k]++;
            if(valid(x, k))
            {
                col[x[k]] = dg1[k + x[k] - 1] = dg2[n - k + x[k]] = 1;
                if(k == n)
                {
                    if(nrsol == 0)
                        afis(x, n);
                    nrsol++;
                    col[x[n]] = dg1[n + x[n] - 1] = dg2[x[n]] = 0;
                    k--; //se poate forta revenirea
                    col[x[k]] = dg1[k + x[k] - 1] = dg2[n - k + x[k]] = 0;
                }
                else
                    x[++k] = 0;
            }
        }
        else
        {
            k--;
            col[x[k]] = dg1[k + x[k] - 1] = dg2[n - k + x[k]] = 0;
        }
}

int main()
{
    f >> n;
    backt();
    g << nrsol;
    return 0;
}