#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

std::vector<int> minp;
std::vector<int> primes;

void sieve(int n){
    minp.assign(n + 5, 0);
    primes.clear();

    fore(i, 2, n + 1){
        if(!minp[i]){
            minp[i] = i;
            primes.push_back(i);
        }
        for(auto p : primes){
            if(p * i > n) break;
            minp[i * p] = p;
            if(minp[i] == p) break;
        }
    }
}

const int N = 100000;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    sieve(N);
    int t;
    std::cin >> t;
    while(t--){
        ll n;
        std::cin >> n;
        ll ans = 1;
        for(auto p : primes){
            if(1ll * p * p > n) break;
            int cnt = 0;
            while(n % p == 0){
                ++cnt;
                n /= p;
            }
            ans *= (1 + 2ll * cnt);
        }
        if(n != 1) ans *= 3;

        ans = (ans + 1) / 2;
        std::cout << ans << endl;
    }
    
    return 0;
}