#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");

int n, nr, sol[500];
bool l[250], c[250], dp[250], ds[250];

int mx = 0;

void fil(int i, int j, int x)
{
    l[i] = x;
    c[j] = x;
    dp[i - j + n] = x;
    ds[j + i] = x;
}
bool ver(int i, int j)
{
    return !l[i] && !c[j] && !dp[i - j + n] && !ds[j + i];
}
void bkt(int k, int i)
{
    if (i == n + 1)
    {
        nr++;
        if (nr == 1)
        {
            for (int l = 1; l <= n; l++) g << sol[l] << ' ';
            g << '\n';
        }
        return;
    }

    for(int j = 1; j<=n; ++j)
        if (ver(i, j))
        {
            fil(i, j, 1);
            sol[i] = j;
            bkt(k + 1, i + 1);
            sol[i] = 0;
            fil(i, j, 0);
        }
}
int main()
{
    f >> n;
    bkt(1, 1);
    g << nr <<"\n";
    return 0;
}