#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vi=vector<int>;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
//上
const ll N  = 1e5+5;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int q;
    cin >> q;
    vector<ll> primes(N,1);
    vector<ll> red;
    for(ll i = 2; i < N;i++){
        if(primes[i]){
            red.push_back(i);
        for(ll j = i* i; j < N; j+=i){
            primes[j] = 0;
        }
        }
    }
    for(int i = 0; i < q; i++){
        ll x;
        cin >> x;
        ll sq = 0;
        for(ll i = 1; i* i <= x;i++){
            if(x%(i*i) == 0)sq++;
        }
        map<ll,ll> mp;
        for(auto &u: red){
            if(x %u == 0){
                x/=u;
                mp[u]++;
            }
        }
        if(x > 1)mp[x]++;
        ll mul = 1;
        for(auto &u: mp){
            mul *= (u.second+2)*(u.second+1)/2;
        }
        mul -=sq;
        mul/=2;
        mul+=1;
        cout<<mul<<'\n';
    }
}