#include <bits/stdc++.h>

#define endl '\n'
#define int ll
using ll = long long;
typedef unsigned long long ull;
using namespace std;
void GordenGhost();
bool prime(ll x){
    if (x==1) return false;
    for (int i = 2; i <= sqrt(x); ++i) {
        if (x%i==0) return false;
    }
    return true;
}
signed main() {
#ifdef Gorden
    freopen("in.txt", "rt", stdin);
    freopen("out.txt", "wt", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    GordenGhost();
    return 0;
}

void GordenGhost() {
    ll q;
    cin>>q;
    while (q--){
        ll n,ans=1;
        cin>>n;
        unordered_map<int,int>mp;
        mp.reserve(1024);
        mp.max_load_factor(0.25);
        for (int i = 2; i <= sqrt(n); ++i) {
            if (prime(i))
                while (n%i==0) mp[i]++,n/=i;
        }
        if (prime(n)) mp[n]++;
        for (auto [a,b] : mp){
            ans*=2*b+1;
        }
        ans/=2;
        cout<<ans<<'\n';
    }
}