#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int MAXN=1e5+5;
int isprime[MAXN],prime[MAXN],cnt;
void Prime()
{
    for(int i=2;i<MAXN;i++)
    {
        if(!isprime[i]) prime[++cnt]=i;
        for(int j=1;j<=cnt && prime[j]*i<MAXN;j++)
        {
            isprime[prime[j]*i]=1;
            if(i%prime[j]==0) break;
        }
    }
}
void solve()
{
    int n,ans=1;
    cin>>n;
    for(int i=1;i<=cnt;i++)
    {
        if(n%prime[i]==0)
        {
            int num=0;
            while(n%prime[i]==0)
            {
                n/=prime[i];
                num++;
            }
            ans*=(2*num+1);
        }
    }
    ans=(ans+1)/2;
    cout<<ans<<endl;
}
signed main()
{
    Prime();
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}