#include <bits/stdc++.h>

#define ll long long

std::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;
            }
        }
    }
}
bool is_prime(int x){
    return (minp[x] == x);
}

void solve(){
	ll n;
	std::cin >> n;
	ll cnt = 1;
	for (auto y : primes) if (n % y == 0){
		ll tmp = 0;
		while (n % y == 0){
			tmp ++;
			n /= y;
		}
		cnt *= (tmp * 2 + 1);
	}

	std::cout << (cnt + 1) / 2 << '\n';


}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	sieve(1E6);
	int q;

	std::cin >> q;

	while (q--){
		solve();
	}

	return 0;
}