#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define ov3(a, b, c, name, ...) name
#define rep0(n) for(ll aaaaa = 0; aaaaa < (n); aaaaa++)
#define rep1(i, n) for(ll i = 0; i < (n); i++)
#define rep2(i, a, b) for(ll i = (a); i < (b); i++)
#define rep(...) ov3(__VA_ARGS__, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a) - 1; i >= b; i--)
#define fore(e, v) for(auto &&e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back
template <typename T, typename S> bool chmin(T &a, S &b) { return a > b ? a = b, true : false; }
template <typename T, typename S> bool chmax(T &a, S &b) { return a < b ? a = b, true : false; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
    int q;
    cin >> q;

    constexpr int M = 1e5 + 100;
    vi table(M, 1);
    table[0] = table[1] = false;
    rep(i, 2, M) {
        if(table[i]) {
            for(int j = i * 2; j < M; j += i) table[j] = 0;
        }
    }
    vi p;
    rep(i, 2, M) if(table[i]) p.eb(i);

    rep(q) {
        ll n;
        cin >> n;
        ll ans = 1;
        fore(x, p) {
            int c = 0;
            while(n % x == 0) n /= x, c++;
            if(c) { ans *= 1 + c * 2; }
        }
        cout << (ans + 1) / 2 << '\n';
    }
}