#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define int long long
vector<int> minp, primes;

void sieve(int n) {
    minp.assign(n + 1, 0);
    primes.clear();
    
    for (int i = 2; i <= n; i++) {
        if (minp[i] == 0) {
            minp[i] = i;
            primes.push_back(i);
        }
        
        for (auto p : primes) {
            if (i * p > n) {
                break;
            }
            minp[i * p] = p;
            if (p == minp[i]) {
                break;
            }
        }
    }
}

void solve() {
    int n;
    cin >> n;
    // n = 10000000000;
    vector<int> a;
    vector<int> c;
    for(int i = 1; i * i <= n; i++) {
        if(n % i == 0) {
            a.push_back(i);
            // if(minp[i]  i) {
                // c.push_back(i);
            // }
            if(i * i != n) {
                // if(minp[n / i] == n / i) {
                    // c.push_back(n / i);
                // }
                a.push_back(n / i);
            }
        }
    }
    sort(a.begin(), a.end());
    set<pair<int, int>> st;
    for(auto x : a) {
        for(auto y : a) {
            if(y * y > x) break;
            if(x % y == 0) {
                int X = x / y, Y = y;
                int G = gcd(X, Y);
                X /= G, Y /= G;
                st.insert({X, Y});
            }
        }
    }
    cout << (int)st.size() << "\n";
}        
    
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    // sieve((int)1e5 + 9);
    int T = 1;
    cin >> T;
    while(T--) solve();

    return 0;
}