#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define int long long
#define endl '\n'
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
int q;
vector<int> is_p;
bool is[N];
void init()
{
    for (int i = 2; i < N; i++)
    {
        if (is[i])
            continue;
        is_p.push_back(i);
        for (int j = i + i; j < N; j += i)
        {
            is[j] = 1;
        }
    }
}
void solve()
{
    int n;
    cin >> n;
    int t = n;
    vector<int> v;
    for (int i = 1; i <= sqrt(t) + 2; i++)
    {
        if (n % i == 0)
            v.push_back(i);
    }
    v.push_back(n);
    map<int, map<int, int>> mp;
    for (int i = 0; i < v.size(); i++)
    {
        for (int j = 0; j <= i; j++)
        {
            int t1 = v[j];
            int t2 = v[i];
            int g = gcd(t1, t2);
            if (n % (t1 * t2) == 0)
            {
                mp[t1 / g][t2 / g]++;
            }
        }
    }
    int res = 0;
    for (auto t : mp)
    {
        res += t.second.size();
    }
    cout << res << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}