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

map<i64, int> Map;

void solve() {
	i64 n;
	cin >> n;
	if (Map.count(n)) {
		cout << Map[n] << "\n";
		return;
	}
	vector<i64> p;
	for (i64 i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			p.emplace_back(i);
			if (i * i != n) {
				p.emplace_back(n / i);
			}
		}
	}
	sort(p.begin(), p.end());
	int m = p.size();
	unordered_set<long double> set;
	for (int i = 0; i < m; i++) {
		int t = lower_bound(p.begin(), p.end(), p[i] * p[i]) - p.begin();
		for (int j = t; j < m; j++) {
			if (p[j] % p[i] == 0) {
				set.insert(1.L * p[i] * p[i] / p[j]);
			}
		}
	}
	cout << set.size() << "\n";
	Map[n] = set.size();
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int t = 1;
	cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}