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

using ll = long long;
using pll = pair<ll, ll>;

ll gcd(ll a, ll b) {
    return a == 0 ? b : gcd(b % a, a);
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int q; cin >> q;
    while (q--) {
        ll n; cin >> n;
        set<pll> st;
        vector<ll> divs;
        for (ll d = 1; d * d <= n; d++) {
            if (n % d == 0) {
                divs.push_back(d);
                divs.push_back(n / d);
            }
        }

        for (auto d : divs) {
            for (ll p = 1; p * p <= d; p++) {
                if (d % p == 0) {
                    ll q = d / p;
                    ll g = gcd(p, q);

                    if (p > q)
                        st.insert({q / g, p / g});
                    else
                        st.insert({p / g, q / g});
                }
            }
        } 

        cout << st.size() << "\n";
    }
}