#include<bits/stdc++.h>
#define ll long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read() {
	ll x=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9') {
		if (c=='-')  f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void print(ll x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
inline void pprint(ll x) {
	print(x);
	puts("");
}
void slv() {
	ll n = read();
	vector<pair<int, int> >q;
	ll nn = n;
	for(int i = 2; i * i <= n; ++i) {
		if(n % i == 0) {
			q.pb(pii(i, 0));
			while(n % i == 0) {
				n /= i;
				q[(int)q.size() - 1].second++;
			}
		}
	}
	if(n > 1) q.pb(pii(n, 1));
	n = nn;
	ll ans = 1ll;
	for(auto zys:q) {
		ll x = zys.first, y = zys.second;
		ans *= (y + 2) * (y + 1) / 2;
	}
	ll ans2 = 0ll;
	for(ll i = 1; i * i <= n; ++i){
		ll sq = sqrt(i);
		if(sq * sq == i && n % i == 0){
			ans2++;
		}
		ll sq2 = sqrt(n / i);
		if(i == n / i) continue;
		if(sq2 * sq2 == i && n % i == 0){
			ans2++;
		}
	}
	
	pprint((ans - ans2) / 2 + ans2);
}
int main() {
	int T = read();
	while(T--) {
		slv();
	}
	return 0;
}