// #pragma GCC optimize("O3")
// #pragma GCC target("popcnt")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>   
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;   
using namespace std;
#define ll long long
const ll INF_MUL=1e13;
const ll INF_ADD=1e18;  
#define pb push_back               
#define mp make_pair          
#define nline "\n"                           
#define f first                                          
#define s second                                             
#define pll pair<ll,ll> 
#define all(x) x.begin(),x.end()     
#define vl vector<ll>           
#define vvl vector<vector<ll>>    
#define vvvl vector<vector<vector<ll>>>          
#ifndef ONLINE_JUDGE    
#define debug(x) cerr<<#x<<" "; _print(x); cerr<<nline;
#else
#define debug(x);  
#endif     
void _print(ll x){cerr<<x;}  
void _print(char x){cerr<<x;}   
void _print(string x){cerr<<x;}    
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   
template<class T,class V> void _print(pair<T,V> p) {cerr<<"{"; _print(p.first);cerr<<","; _print(p.second);cerr<<"}";}
template<class T>void _print(vector<T> v) {cerr<<" [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T>void _print(set<T> v) {cerr<<" [ "; for (T i:v){_print(i); cerr<<" ";}cerr<<"]";}
template<class T>void _print(multiset<T> v) {cerr<< " [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T,class V>void _print(map<T, V> v) {cerr<<" [ "; for(auto i:v) {_print(i);cerr<<" ";} cerr<<"]";} 
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<pair<ll,ll>, null_type, less<pair<ll,ll>>, rb_tree_tag, tree_order_statistics_node_update> ordered_pset;
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
const ll MOD=998244353;   
const ll MAX=100100; 
vector<ll> prime_fac[MAX]; 
vector<ll> len(MAX,0);
ll check(ll a,ll b){
    if(len[a]>len[b]){
        swap(a,b);
    }
    for(auto it:prime_fac[a]){
        if((b%it)==0){
            return 0;
        }
    }
    return 1;    
}  
map<ll,ll> found;    
void solve(){   
    ll n; cin>>n;  
    ll ans=0; 
    for(ll i=1;i*i<=n;i++){
        if(n%(i*i)){
            continue; 
        }   
        for(ll j=1;(j*j*i*i)<=n;j++){
            ll cur=n/(i*i);    
            ll div=j*j+1;      
            if(cur%div){
                continue;    
            }         
            cur=cur/div;   
            cur--;
            if(cur==0){      
                continue; 
            }
            if(found[cur]==0){         
                continue;
            }
            ans+=check(j,found[cur]); 
        }   
    }
    cout<<ans<<nline; 
    return;
}                                        
int main()                                                                           
{  
    ios_base::sync_with_stdio(false);                         
    cin.tie(NULL);                              
    #ifndef ONLINE_JUDGE                 
    freopen("input.txt", "r", stdin);                                           
    freopen("output.txt", "w", stdout);      
    freopen("error.txt", "w", stderr);                        
    #endif    
    ll test_cases=1;               
    cin>>test_cases;  
    for(ll i=1;i<MAX;i++){
        found[i*i]=i; 
    }
    for(ll i=2;i<MAX;i++){
        if(len[i]){
            continue;
        }
        for(ll j=i;j<MAX;j+=i){
            len[j]++;
            prime_fac[j].pb(i); 
        }
    }
    while(test_cases--){
        solve();
    }
    cout<<fixed<<setprecision(10);
    cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n"; 
}