#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 5;
using pii = pair<ll, ll>;
ll n, m, k;
const ll P = 998244353;
ll qp(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = res * a;
        }
        b >>= 1;
        a = a * a;
    }
    return res;
}
void solve() {
    cin >> n;
    map<ll, int> mp;
    for (int i = 2; i <= n / i; i++) {
        if (n < i) {
            break;
        }
        if (n % i == 0) {
            while (n % i == 0) {
                mp[i]++;
                n /= i;
            }
        }
    }
    if (n != 1) {
        mp[n]++;
    }

    int ans = 0;
    n = mp.size();
    vector<int> a;
    for (auto [x, y] : mp) {
        a.push_back(y);
    }
    for (int now = 0; now < n; now++) {
        int sum = a[now];
        int fg = 0;
        for (int i = 0; i < (1 << n); i++) {
            if (i >> now & 1) {
                break;
            }
            for (int j = 0; j < n; j++) {
                if (i >> j & 1) {
                    sum *= a[j];
                    fg = 1;
                }
            }
        }
        if (fg)
            ans += sum;
    }
    // cout << ans;
    ans = (ans + 1) / 2;
    int res = 1;
    for (auto [x, y] : mp) {
        res *= (y + 1);
    }
    ans += res;
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}