#include <iostream>
using namespace std;

class queentable
{
public:
    int** table;
    int size;
    int anscnt;
    void putqueen(int row, int col)
    {
        if (row == 0)
        {
            for (int i = row + 1; i < size; i++)
                for (int j = 0; j < size; j++)
                    if (table[i][j] == 10 + row)
                        table[i][j] = 99;
        }
        table[row][col] = 55;
        if (row != size - 1)
        {
            for (int i = 0; i < size; i++)
            {
                if (row + i < size)
                {
                    if (table[row + i][col + i] == 99)
                        table[row + i][col + i] = 10 + row;
                    if (table[row + i][col] == 99)
                        table[row + i][col] = 10 + row;
                    if (table[row + i][col - i] == 99)
                        table[row + i][col - i] = 10 + row;
                }
            }
            findplace(row + 1);
        }
        else
        {
            this->anscnt += 1;
        }
        table[row][col] = 99;
    }
    void findplace(int row)
    {
        for (int i = 0; i < size; i++)
        {
            if (table[row][i] == 99)
            {
                putqueen(row, i);
                for (int i = row + 1; i < size; i++)
                    for (int j = 0; j < size; j++)
                        if (table[i][j] == 10 + row)
                            table[i][j] = 99;
            }
        }

    }
    queentable(int size)
    {
        this->size = size;
        this->anscnt = 0;
        table = (int**)calloc(sizeof(*table), size);
        for (int i = 0; i < size; i++)
            table[i] = (int*)calloc(sizeof(int), size);
        for (int i = 0; i < size; i++)
        {
            for (int j = 0; j < size; j++)
            {
                table[i][j] = 99;
            }
        }
    }
    ~queentable()
    {
        for (int i = 0; i < size; i++)
            free(table[i]);
        free(table);
    }
    int totalcal()
    {
        for (int i = 0; i < size; i++)
            putqueen(0, i);

        return anscnt;
    }
};

int main()
{
    int number;
    cin >> number;
    int* numbers;
    numbers = (int*)calloc(sizeof(int), number);

    for (int i = 0; i < number; i++)
        cin >> numbers[i];
    for (int i = 0; i < number; i++)
    {
        queentable table(numbers[i]);
        cout << table.totalcal()<<endl;
    }
}