#include <stdio.h>//#include <bits/stdc++.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdio>
#define  MAX(x,y) (((x)>(y)) ? (x) : (y))
#define  MIN(x,y) (((x)<(y)) ? (x) : (y))
#define  sq(x) (x)*(x)
#define  cei(a,b) (long long)(((a)+(b)-1)/(b))
#define  mst(a,b) memset((a),b,sizeof((a)))
#define  fi first
#define  se second
#define  pb push_back
using namespace std;
const int MAXN = 1e6+5;
const int N=1e5+5;
const int E4=1e4;
//const long long mod = 1e9+7 ;
//const long long mod = 998244353 ;
const int inf = 0x3f3f3f3f;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int dx[4]= {1,0,0,-1};
int dy[4]= {0,-1,1,0};
int n,m,k;
int ans[100]= {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};
void solve()
{
    scanf("%d",&n);
    printf("%d\n",ans[n]);
}
int main()
{
//    freopen("D:\\desktop\\in.txt","r",stdin);
//    freopen("D:\\desktop\\out2.txt","w",stdout);
    int T=1;
    scanf("%d",&T);
    for(int i=1; i<=T; i++) {
//        printf("Case %d:\n",i);

        solve();

    }
    return 0;
}