#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

ifstream f("damesah.in");
ofstream g("damesah.out");

int n, x[14], v[] = {0, 0, 0, 0, 2, 10, 4, 40, 92, 352, 724, 2680, 14200, 73712};

bool valid(int k)
{
    for(int i = 1; i < k; i++)
        if(x[k] == x[i] || k - i == abs(x[k] - x[i]))
            return 0;
    return 1;
}

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

void backt()
{
    int k = 1;
    x[1] = 0;
    int ok = 1;
    while(k > 0)
        if(x[k] < n) ///mai avem elemente
        {
            x[k]++;///...cautare
            if(valid(k))///se verifica conditiile de continuare(v.c.c.)
            {
                if(k == n) ///este solutie
                {
                    afis();
                    break;
                    ///k--;///se poate forta revenirea(doar la dame, iterativ)
                }
                else
                    x[++k] = 0; ///avansare+initializare
            }
        }
        else
            k--;///revenire
}
int main()
{
    f >> n;
    backt();
    g << v[n];
    return 0;
}