/*
    Author: Zhikun Wang
*/
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<'='<<x<<endl

using namespace std;
template<typename T> void read(T &x){
    x = 0;int f = 1;char ch = getchar();
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch = getchar();}
    while(isdigit(ch)){x = x*10+ch-48; ch = getchar();}x*=f;
}
template<typename T, typename ... Args> void read(T &x,Args&... nxt){
    read(x);
    read(nxt...);
}

#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

typedef bitset<80> B;


int n;

unordered_map<B,ll> Mp;
void solve(){
    Mp.clear();
    cin>>n;
    vi C({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});
    cout<<C[n-1]<<endl;
    return;
    if(n == 1){
        cout<<1<<endl;
        return;
    }
    B cccc; cccc.reset();
    vector<B> Q;
    Q.push_back(cccc);
    Mp[cccc] = 1;
    ll ans = 0;
    B cmp; cmp.reset(); for(int i=0;i<n;i++)cmp[i] = 1;
    for(int i=0;i<Q.size();i++){
        B c = Q[i]; int c2 = c.count();
        //cout<<c<<' '<<Mp[c]<<endl;
        int p = c2;
        for(int rep = 0;rep<2;rep++){
            if(c[p] == 0){
                B nc = ((c>>p)|(c<<(n-p)))&cmp;
                if(c2*2>=n){
                //    cout<<rep<<' '<<c<<' '<<(nc^cmp)<<endl;
                    ans+=Mp[c]*Mp[nc^cmp];
                }else{
                    nc[0] = 1;
                    if(Mp[nc] == 0){
                        Q.push_back(nc);
                    }
                    Mp[nc]+=Mp[c];
                }
            }
            //cout<<p<<' '<<n<<' '<<n-p<<endl;
            p = n-p;
        }
    }
    cout<<ans/4<<endl;
}
int T;
int main(){
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}