#include <bits/stdc++.h>
using namespace std;
#define int long long 
int solve()
{
    int n;cin>>n;
    // int n=1e10;
    int ans=0;
    auto insert= [&](int x,int y){
        int g=gcd(x,y);
        if(g==1)ans++;
    };
    vector<pair<int,int>> v;
    int tot=1;
    {
        int t=n;
        for(int i=2;i*i<=t;i++){
            int y=0;
            while(t%i==0){
                y++;t/=i;
            }
            if(y>0)v.emplace_back(i,y);
        }
        if(t>1)v.emplace_back(t,1);
        for(auto [x,y]:v)tot=tot*(y+1);
    }
    int siz=v.size();
    int all=0;
    for(int i=0;i<(1<<siz);i++){
        int ans1=1,ans2=1;
        for(int j=0;j<siz;j++){
            if(i>>j&1)ans1=ans1*(v[j].second+1);
            else ans2=ans2*(v[j].second+1);
        }
        all+=(ans1-1)*(ans2-1);
        // cout<<"i="<<i<<" ans1="<<ans1<<" ans2="<<ans2<<endl;
    }
    all/=2;
    return all+tot;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;
    while(T--)cout<<solve()<<"\n";
}