#include<bits/stdc++.h>

using namespace std;

int n;
long long sum;
int h[85]={0,1,2,2,4,2,4,4,8,2,4,6,8,2,8,6,16,2,4,6,8,4,12,6,16,4,4,4,16,2,12,10,32,4,4,8,8,2,12,6,16,2,8,6,24,6,12,8,32,6,8,6,8,2,8,10,32,4,4,6,24,2,20,6,64,6,8,8,8,4,16,6,16,2,4,8,24,14,12,6,32};
int st[90];

void dfs(int id,int step)
{
    if(step==n)
    {
        bool flag=1;
        for(int i=1;i<n;i++)
        {
            if(st[i]==0)
            {
                flag=0;
                break;
            }
        }
        if(flag==1)sum++;
        return ;
    }
    if(st[(id+step)%n]==0)
    {
        st[(id+step)%n]++;
        dfs((id+step)%n,step+1);
        st[(id+step)%n]--;
    }
    if(st[(id-step+n)%n]==0)
    {
        st[(id-step+n)%n]++;
        dfs((id-step+n)%n,step+1);
        st[(id-step+n)%n]--;
    }
    return ;
}

int main()
{
    //freopen("1.out","w",stdout);
    
    /*
    for(int i=61;i<=80;i++)
    {
        sum=0;
        n=i;
        dfs(0,1);
        cout<<sum<<",";
    }
    */
    
    int T;
    cin>>T;
    while(T--)
    {
        memset(st,0,sizeof st);
        sum=0;
        
        cin>>n;
        cout<<h[n]<<endl;
    }
    
    return 0;
}