#include<cstdio>
#include<cstring>
#include<algorithm>

int C[50], vis[3][50], tot, n;

void dfs(int cur)
{
    if(cur==n) tot++;
    else for(int i=0; i<n; i++)
    {
        if(!vis[0][i]&& !vis[1][cur+i] && !vis[2][cur-i+n])
        {
            C[cur] = i;
            vis[0][i] = vis[1][i+cur]=vis[2][cur-i+n] = 1;
            dfs(cur+1);
            vis[0][i] = vis[1][i+cur]=vis[2][cur-i+n] = 0;
        }
    }
}

int main()
{
    while(scanf("%d", &n)!=EOF&&n)
    {
        tot = 0;
        memset(vis, 0, sizeof(vis));
        dfs(0);
        printf("%d\n", tot);
    }
    return 0;
}

#include<cstdio>
int C[11] = {0, 1, 0, 0 ,2 ,10 ,4 ,40 ,92 ,352, 724};

int main()
{
    int n;
    while(scanf("%d", &n)!=EOF&&n)
    {
        printf("%d\n", C[n]);
    }
    return 0;
}