#include "bits/stdc++.h"

using i64 = long long;
using namespace std;

vector<int> pp;

vector<int> getprime(int n) {
    vector<int> p;
    vector<int> pri(n + 1);
    for (int i = 2; i <= n; i++) {
        if (pri[i]) continue;
        p.emplace_back(i);
        for (int j = i; j <= n; j += i) {
            pri[j] = 1;
        }
    }
    return p;
}

i64 qpow(i64 a, i64 b) {
    i64 res = 1;
    while (b) {
        if (b & 1) res *= a;
        a = a * b;
        b /= 2;
    }
}

void solve() {
    i64 n;
    int res = 1;

    vector<pair<i64, i64>> mp;
    cin >> n;
    if (n == 1) {
        cout << 1 << endl;
        return;
    }
    for (auto i: pp) {
        if (n % i == 0) {
            int t = 0;
            while (n % i == 0) {
                t++;
                n /= i;
            }
            mp.emplace_back(i, t);
        }
        if (i * i > n) {
            if (n != 1)
                mp.emplace_back(n, 1);
            break;
        }
    }
    set<pair<int, int>> s;
    function<void(int, i64, i64)> dfs = [&](int n, i64 a, i64 b) {
//        cerr << a << " " << b << endl;
        if (a < b) {
            if (!s.count({a, b})) {
                s.emplace(a, b);
                res++;
            }
        }
        if (n == mp.size()) {
            return;
        }
        dfs(n + 1, a, b);
        auto [k, t] = mp[n];
        i64 zz = 1;
        for (int i = 1; i <= t; i++) {
            zz *= k;
            dfs(n + 1, a * zz, b);
            dfs(n + 1, a, b * zz);
        }
    };
    dfs(0, 1, 1);
    cout << res << "\n";


}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t;
    pp = getprime(1e6);
    cin >> t;
    while (t--) {
        solve();
    }

}