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

// Function to generate all prime numbers up to n using Sieve of Eratosthenes
vector<int> sieve(int n) {
    vector<bool> is_prime(n+1, true);
    is_prime[0] = is_prime[1] = false;
    for(int i=2; i*i <=n; ++i){
        if(is_prime[i]){
            for(int j=i*i; j<=n; j+=i){
                is_prime[j] = false;
            }
        }
    }
    vector<int> primes;
    for(int i=2; i<=n; ++i){
        if(is_prime[i]) primes.push_back(i);
    }
    return primes;
}

// Function to factorize n using the list of primes
vector<pair<ll, int>> factorize(ll n, const vector<int>& primes){
    vector<pair<ll, int>> factors;
    for(auto p : primes){
        if((ll)p * p > n) break;
        if(n % p == 0){
            int count =0;
            while(n % p ==0){
                count++;
                n /= p;
            }
            factors.emplace_back(make_pair((ll)p, count));
        }
    }
    if(n >1){
        factors.emplace_back(make_pair(n,1));
    }
    return factors;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    // Precompute primes up to 100,000
    vector<int> primes = sieve(100000);
    
    int q;
    cin >> q;
    while(q--){
        ll n;
        cin >> n;
        if(n ==0){
            cout << "0\n";
            continue;
        }
        // Factorize n
        vector<pair<ll, int>> factors = factorize(n, primes);
        // Calculate the product of (2*e_i +1)
        ll total =1;
        for(auto &[prime, exp] : factors){
            total *= (2LL * exp +1);
        }
        // Calculate (total +1)/2
        ll answer = (total +1)/2;
        cout << answer << "\n";
    }
}