#include<bits/stdc++.h>
using namespace std;

#define endl "\n"
#define ll long long
map<pair<ll,ll>,int> mp;
vector<ll> q;
ll n;
void solve(){
	cin >> n;
	mp.clear();
	q.clear();
	ll i;
	for(i = 1 ; i * i <= n; i ++){
		if(n % i == 0){
			ll j = n / i ;
			q.push_back(i);
			if(i == j)continue;
			q.push_back(j);
		}
	}
	for(int i = 0 ; i < q.size() ; i ++){
		for(int j = 0 ; j < q.size() ; j ++){
		    ll x = q[i],  y = q[j];
		    if(n % (x * y) == 0){
		    	if(x > y)swap(x , y);
		    	ll tmp = __gcd(x , y);
		    	x /= tmp , y /= tmp;
		    	mp[{x, y}] = 1; 
			}
		}
	}
	cout << mp.size() << endl;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t = 1;
	cin>>t;
	for(int i=1;i<=t;i++){
		solve();
	}
	return 0;
}