#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

long long n;
vector<pair<long long, long long>> res;

void brute(int i, const vector<pair<long long, int>> &f, long long pq, long long q){
	if (i == int(f.size())){
		long long p = pq / q;
		if (p > q) return;
		long long g = __gcd(p, q);
		res.push_back({p / g, q / g});
		return;
	}
	for (int j = 0; j <= f[i].second; ++j){
		long long nq = q;
		for (int k = 0; k <= j; ++k){
			brute(i + 1, f, pq, nq);
			nq *= f[i].first;
		}
		pq *= f[i].first;
	}
}

void solve(){
	vector<pair<long long, int>> f;
	for (long long i = 2; i * i <= n; ++i) if (n % i == 0){
		int cnt = 0;
		while (n % i == 0){
			++cnt;
			n /= i;
		}
		f.push_back({i, cnt});
	}
	if (n > 1){
		f.push_back({n, 1});
	}
	res.clear();
	brute(0, f, 1, 1);
	sort(res.begin(), res.end());
	res.resize(unique(res.begin(), res.end()) - res.begin());
	cout << res.size() << '\n';
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int tc;
	cin >> tc;
	while (tc--){
		cin >> n;
		solve();
	}
}