#include <bits/stdc++.h>

#define int long long

struct Prime
{
    int n;
    int cnt = 0;
    std::vector<int> a, vis;
    Prime(int n) : n(n), a(n + 1), vis(n + 1)
    {
        auto get_prime = [&]()
        {
            vis[0] = vis[1] = true;
            for (int i = 2; i <= n; ++i)
            {
                if (!vis[i])
                {
                    a[++cnt] = i;
                }
                for (int j = 1; j <= cnt and i * a[j] <= n; ++j)
                {
                    vis[i * a[j]] = 1;
                    if (i % a[j] == 0)
                    {
                        break;
                    }
                }
            }
        };
        get_prime();
        a.resize(cnt + 1);
    }
};

Prime P(1e5);
signed main()
{
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);

    int t;
    std::cin >> t;
    while (t--)
    {
        int x;
        std::cin >> x;
        std::vector<int> fac;

        for (int i = 1; i * i <= x; ++i)
        {
            if (x % i == 0)
            {
                fac.push_back(i);
                if (i * i != x)
                {
                    fac.push_back(x / i);
                }
            }
        }
        auto check = [&](int x)
        {
            for (int i = 2; i * i <= x; ++i)
            {
                if (x % i == 0)
                {
                    return false;
                }
            }
            return true;
        };
        int cnt = 0;
        for (auto i : fac)
        {
            if (i <= 1e5 and !P.vis[i])
            {
                ++cnt;
            }
            else if (i > 1e5)
            {
                cnt += check(i);
            }
        }
        int ans = fac.size() + cnt * (cnt - 1) / 2;
        std::cout << ans << '\n';
    }
    // 最多只有一个>=sqrt(n)的质因子
}