#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 2500;

ll n, d[maxn], m;

struct frac {
	ll x, y;
	frac(ll a = 0, ll b = 1) {
		if (b < 0) {
			a = -a;
			b = -b;
		}
		x = a;
		y = b;
	}
};

inline bool operator < (const frac &a, const frac &b) {
	return a.x * b.y < a.y * b.x;
}

void solve() {
	m = 0;
	scanf("%lld", &n);
	for (ll i = 1; i * i <= n; ++i) {
		if (n % i) {
			continue;
		}
		d[++m] = i;
		if (i * i != n) {
			d[++m] = n / i;
		}
	}
	set<frac> S;
	sort(d + 1, d + m + 1);
	for (int i = 1; i <= m; ++i) {
		for (int j = i; j <= m; ++j) {
			if (d[i] * d[j] > n) {
				break;
			}
			if (n % (d[i] * d[j]) == 0) {
				S.emplace(d[i], d[j]);
			}
		}
	}
	printf("%d\n", (int)S.size());
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}