#include <bits/stdc++.h>
using namespace std;
int n, cnt = 0, a[15][15] = { 0 }, ans[15];
void seta(int i, int j, int p)
{
    ans[i] = j;
    a[i][j] = 1;
    for (int k = 1; k <= n; k++) // 同行同列
    {
        a[k][j] = p;
        a[i][k] = p;
    }
    for (int m = 1; m <= n; m++)
    { // 副对角线方向
        for (int l = 1; l <= n; l++)
        {
            if (m + l == i + j)
                a[m][l] = p;
            if (m - l == i - j) // 主对角线方向
                a[m][l] = p;
        }
    }

}
void dfs(int pos)
{
    if (pos == n + 1)
    {
        cnt += 1;
        if (cnt <= 3) {
            for (int i = 1; i <= n; i++)
                cout << ans[i] << " ";
            cout << endl;
        }
    }
    else if (pos < n + 1)
    {
        for (int j = 1; j <= n; j++)
        {
            if (!a[pos][j])
            {
                int b[15][15] = { 0 };
                memcpy(b, a, sizeof(a));
                seta(pos, j, 1);
                dfs(pos + 1);
                memcpy(a, b, sizeof(a));
            }
        }
    }
}
int main()
{
    cin >> n;
    dfs(1);
    cout << cnt;
    return 0;
}