#include <iostream>
#include <algorithm>

using namespace std;


const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;

int T, n, cnt=0;
int Q[100];
int pos(int i, int n)
{
    if(i<1)
        return i+n;
    if(i>n)
        return i-n;
    return i;
}
void run(int turn, int cp)
{
    if (turn==n)
    {
        cnt++;
        return;
    }
    //left
    int p;
    p = pos(cp+turn,n);
    if (Q[p]==0)
    {
        Q[p] = 1;
        run(turn+1,p);
        Q[p] = 0;
    }
    //right
    p = pos(cp-turn,n);
    if (Q[p]==0)
    {
        Q[p] = 1;
        run(turn+1,p);
        Q[p] = 0;
    }

}
int main() {
    int turn=1;
    int cp=1; //current point

    cin >> T;
    while (T--) {
        cin >> n;
        for (int i=2;i<=80; i++)
            Q[i]=0;
        Q[1] = 1;
        turn =1;
        cp = 1;
        cnt = 0;
        run(turn,cp);

        cout << cnt << endl;
    }
    return 0;
}