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

void solve(){
    ll n;
    cin >> n;
    ll m = sqrt(n);
    vector<ll> num;
    for(ll i = 1; i <= m; i++){
        if(n % i == 0){num.push_back(i); if (i != n / i) num.push_back(n/i);}
    }
    sort(num.begin(), num.end());
    vector<pair<ll, ll>> ans;
    for(int i = 0; i < num.size(); i++){
        for(int j = i; j < num.size(); j++){
            ll d = __gcd(num[i], num[j]);
            if (d == 1) ans.push_back({num[i]/d, num[j]/d});
        }
    }
    // for(int i = 0; i < ans.size(); i ++){
    //     cout << ans[i].first << " " << ans[i].second << endl;
    // }
    cout << ans.size() << "\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--)
    solve();
    return 0;
}