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

const int N = 1e6 + 5;
const int M = 2e5;

vector<int> pri;
int is_prime[N];

void euler_sieve() {
    is_prime[0] = 1, is_prime[1] = 1;
    for (int i = 2;i <= M;i++) {
        if (!is_prime[i]) {
            pri.push_back(i);
        }
        for (int pj : pri) {
            if (i * pj > M)
                break;
            is_prime[i * pj] = 1;
            if (i % pj == 0)
                break;
        }
    }
}

void solve(){
    ll n;
    cin >> n;
    ll res = 1;
    for (int i = 0;pri[i] * pri[i] <= n;i++) {
        int cnt = 0;
        while (n % pri[i] == 0) {
            n /= pri[i];
            cnt++;
        }
        res *= (2LL * cnt + 1LL);
    }
    if (n != 1) res *= 3LL;
    cout << (res + 1) / 2 << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    euler_sieve();
    int t;
    cin >> t;
    while(t--)
    solve();
    return 0;
}