#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

typedef long long LL;
const LL N = (LL)1e10;
const LL Nt = 1e5;

	vector<LL>list;
	bool isp[Nt + 3];

void shai(){
	list.clear();
	memset(isp, -1, sizeof isp);
	for(LL i = 2; i * i <= Nt; i++){
		if(isp[i]){
			list.push_back(i);
			for(int j = 0; j < list.size() && list[j] * i <= Nt; j++)
				isp[list[j] * i] = false;
		}
		else {
			for(int j = 0; j < list.size() && list[j] * i <= Nt; j++){
				isp[list[j] * i] = false;
				if(i % list[j] == 0)
					continue;
			}
		}
	}
//	for(int i = 0; i < list.size(); i++)
//		printf("%d ", list[i]);
}

	LL n,m;
	LL p[Nt],c[Nt];
	LL tmp,ans;
	


void divide(LL nn){
	m=0;
	for(int i = 0, p0; i < list.size(); i++){
		p0 = list[i];
		if(nn%p0==0){
			p[++m]=p0,c[m]=0;
			while(nn%p0==0) nn/=p0,c[m]++;
		}
	}
	if(nn>1)
	    p[++m]=nn,c[m]=1;
}

int main(){
	shai();
	
	int T; cin>>T;
	while(T--){
		cin>>n;
		divide(n);
		tmp=1,ans=1;
		p[0]=1,c[0]=1;
		for(int i=1;i<=m;i++) tmp*=c[i]+1;
		for(int i=1;i<=m;i++){
			ans*=(2*c[i]+1);
		}
		
		
		ans=(ans-1)/2+1;
		cout<<ans<<endl;
	}
	return 0;

}