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

#define endl "\n"
#define ll long long
map<pair<ll,ll>,int> mp;
set<ll> st;
ll n;
void solve(){
	cin >> n;
	ll nn = n;
	mp.clear();
	st.clear();
	ll i;
	vector<ll> a;
	for(i = 2 ; i <= n ; i ++) {
		while(n != i) {
			if(n % i == 0) {
				a.push_back(i);
				n /= i;
			}
			else break;
		}
	}
	if(n > 1) a.push_back(n);
	a.push_back(1);
	for(i = 0 ; i < a.size() ; i ++) {
		set<ll> st2;
		st2 = st;
		for(auto &it : st2) {
			st.insert(it * a[i]);
		}
		st.insert(a[i]);
	}
//	for(auto &it:st) cout << it << ' ';
//	cout << endl;
	for(auto &xx:st){
		for(auto &yy:st){
		    ll x = xx,  y = yy;
		    if(nn % (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;
}