#include <bits/stdc++.h>
using namespace std;
#define int long long
int __ = 1,n;
void solve(){
    cin >> n;
    vector<int>ve;

    for(int i = 1; i * i <= n; ++ i)
    {
        if(n%i == 0)
        {
            if(i*i == n) ve.push_back(i);
            else ve.push_back(i), ve.push_back(n/i);
        }

    }
    vector<pair<int,int>>v;
    for(int i = 0; i < ve.size(); ++ i)
    {
        for(int j = 1; j*j <= ve[i]; ++ j)
        {
            if(ve[i] % j == 0)
            {
                int p, q;
                p = j, q = ve[i]/j;
                if(p > q) swap(p,q);
                int gc = gcd(p,q);
                p /= gc, q /= gc;
                v.emplace_back(p,q);
            }
        }
    }
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    cout << v.size() << '\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    cin >> __;
    while (__--){
        solve();
    }
    return 0;
}