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

long long brute_force(map<long long, int> &freqs, vector<int> &mask, int cur) {
    if (cur == freqs.size()) {
        long long prod = 1;
        int cnt = 0;
        for (auto it = freqs.begin(); it != freqs.end(); it++) {
            if (mask[cnt] != 0) {
                prod *= it->second;
            }
            cnt++;
        }
        return prod;
    }
    long long res = 0;
    for (int i = 0; i < 3; i++) {
        mask[cur] = i;
        res += brute_force(freqs, mask, cur + 1);
    }
    return res;
}

void solve() {
    long long n;
    cin >> n;

    map<long long, int> freqs;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            freqs[i]++;
            n /= i;
        }
    }
    if (n > 1) {
        freqs[n]++;
    }

    vector<int> mask(freqs.size());
    long long res = brute_force(freqs, mask, 0);
    cout << (res - 1) / 2 + 1 << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}