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

unordered_map<int, int> mpp;
void solve()
{
   
        ll n;
        cin>>n;
        if(mpp.count(n)){
            cout<<mpp[n]<<endl;
            return ;
        }
        // n=10000000000;
        vector<ll > pq;
        for(ll i=1;i*i<=n;i++)
        {
            if(n%i==0)
            {
                pq.push_back(i);
                if(i!=n/i) pq.push_back(n/i);
            }
        }
        sort(pq.begin(),pq.end());
        set<pair<ll,ll> >ans;
        
        for(int i=0;i<pq.size();i++)
        {
            for(int j=i;j<pq.size();j++)
            {
                if(n%(pq[i]*pq[j])==0)
                {
                    ll g=__gcd(pq[i],pq[j]);
                    ans.insert({pq[i]/g,pq[j]/g});
                }
                if(pq[i]*pq[j]>n) break;
            }
        }
        
        cout<<ans.size();
        mpp[n] = ans.size();
        cout<<endl;
}

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