#include<bits/stdc++.h>
using namespace std;
int n,a[83],sum;
void dfs(int k,int m)
{
    if (m == n )
    {
        sum++;
        return ;
    }
    int l = (k - m + n) % n;
    int r = (k + m + n) % n;
    if(k==0)
    {
        a[1] = 1;
        dfs(1, m + 1);
    }
    else
    {
        if(a[r]==0)
        {
            a[r] = 1;
            dfs(r, m + 1);
            a[r] = 0;
        }
        if(a[l]==0)
        {
            a[l] = 1;
            dfs(l, m + 1);
            a[l] = 0;
        }
    }
    return ;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        
        scanf("%d", &n);
        memset(a, 0, sizeof(a));
        a[0] = 1;
        sum = 0;
        dfs(0,1);
        printf("%d\n", sum * 2);
    }
}