#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'

map<int,int>mp;
void solve()
{
    ll n;
    cin>>n;
    if(mp.count(n))
    {
    	cout<<n<<"\n";
    	return ;
	}
    vector<ll > pq;
    for(ll i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            // n:i n/i
            pq.push_back(i);
            if(i!=n/i) pq.push_back(n/i);
        }
    }

    set<pair<ll ,ll > > ans;
    for(auto t:pq)
    {
        for(ll i=1;i*i<=t;i++)
        {
            if(t%i==0)
            {
                ll st=__gcd(i,t/i);
                ans.insert({i/st,(t/i)/st});
            }
        }
    }
    mp[n]=ans.size();
    cout<<ans.size()<<endl;
}

int main (){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    
    return 0;
}