#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N=100010;
vector<ll> pri;
bool vis[N];
void init(){
    for(int i=2;i<N;i++){
        if(!vis[i])pri.push_back(i);
        for(int j=0;pri[j]*i<N;j++){
            vis[i*pri[j]]=1;
            if(i%pri[j]==0)break;
        }
    }
}

void solve(){
    ll n;cin>>n;
    ll t=n;
    vector<int> v;
    for(int i=0;pri[i]*pri[i]<=t;i++){
        if(t%pri[i]==0){
            int cnt=0;
            while(t%pri[i]==0){
                t/=pri[i];
                cnt++;
            }
            v.push_back(cnt);
        }
    }
    if(t>1)v.push_back(1);
    ll ans=0;
    
    int sz=v.size();
    for(int i=0;i<(1<<sz);i++){
        ll t1=1,t2=1;
        for(int j=0;j<sz;j++){
            if(i>>j&1)t1=t1*(v[j]+1);
            else t2=t2*(v[j]+1);
        }
        ans+=(t1-1)*(t2-1);
    }
    ans/=2;
    // cout<<ans<<" ";

    t=1;
    for(auto i:v)t=t*(i+1);
    ans+=t;
    cout<<ans<<"\n";
}

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