#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int *x, n, nrsol = 0;
ifstream f("damesah.in");
ofstream g("damesah.out");

int valid(int x[], 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(int x[], int n)
{
    for(int i = 1; i <= n; i++)
        g << x[i] << ' ';
    g << '\n';
}

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


int main()
{
    f >> n;
    x = new int [n + 1];
    backt(n);
    g << nrsol;
    return 0;
}