#include<bits/stdc++.h>
using namespace std;
using u64 = uint64_t;
u64 binpower(u64 base, u64 e, u64 mod) {
    u64 result = 1;
    base %= mod;
    while (e) {
        if (e & 1)
            result = (u64)result * base % mod;
        base = (u64)base * base % mod;
        e >>= 1;
    }
    return result;
}
bool check_composite(u64 n, u64 a, u64 d, int s) {
    u64 x = binpower(a, d, n);
    if (x == 1 || x == n - 1)
        return false;
    for (int r = 1; r < s; r++) {
        x = (u64)x * x % n;
        if (x == n - 1)
            return false;
    }
    return true;
};
bool MillerRabin(u64 n) { // returns true if n is probably prime, else returns false.
    if (n < 4)
        return n == 2 || n == 3;
    int s = 0;
    u64 d = n - 1;
    while ((d & 1) == 0) {
        d >>= 1;
        s++;
    }
    for (int a:{2, 3, 5, 7, 11, 13, 17, 19, 23,29,31,37}) {
        if(n==(u64)a)return true;
        if (check_composite(n, a, d, s))
            return false;
    }
    return true;
}
long long int count_divisor(long long int n)
{
    long long int div=1,x=n;
    for(long long int i=2;i*i*i<=x;i++)
    {
        long long int j=1;
        while(n%i==0)
        {
            j++;
            n/=i;
        }
        div*=j;
    }
    long long int p=sqrt(n);
    if(n==1)div*=1;
    else if(MillerRabin(n))div*=2;
    else if(p*p==n)div*=3;
    else div*=4;
    return div;
}
int main()
{
     long long int t,n,m,x,y,z,i,j,k;
     scanf("%lld",&t);
     while(t--)
     {
         scanf("%lld",&n);
         cout<<count_divisor(n)<<endl;
     }
}