#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;

const int N=1e5+5;
int T,isp[N];
ll n;
vector<ll> pr;

void sieve(int n)
{
    for(int i=2;i<=n;i++)
    {
        if(!isp[i]) pr.pb(i);
        for(ll p:pr)
        {
            if(p*i>n) break;
            isp[p*i]=1;
            if(i%p==0) break;
        }
    }
    //cerr<<pr.size();
}

ll work(ll n)
{
    if(n==1) return 1;
    ll ans=1;
    for(int p:pr)
    {
        int cnt=0;
        while(n%p==0) n/=p,cnt++;
        ans*=(cnt+cnt+1);
    }
    if(n!=1) ans*=3;
    return (ans+1)/2;
}

void solve()
{
    scanf("%lld",&n);
    printf("%lld\n",work(n));
}

int main()
{
    sieve(1e5);
    scanf("%d",&T);
    while(T--) solve();
}