#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 = 100100;
const int N = 100000;

ll n, m, pr[maxn], tot, mpr[maxn];
pii p[maxn];
bool vis[maxn];

inline void init() {
	for (int i = 2; i <= N; ++i) {
		if (!vis[i]) {
			pr[++tot] = i;
			mpr[i] = i;
		}
		for (int j = 1; j <= tot && i * pr[j] <= N; ++j) {
			vis[i * pr[j]] = 1;
			mpr[i * pr[j]] = pr[j];
			if (i % pr[j] == 0) {
				break;
			}
		}
	}
}

void solve() {
	m = 0;
	scanf("%lld", &n);
	while (n > 1) {
		ll t = mpr[n], cnt = 0;
		while (n % t == 0) {
			n /= t;
			++cnt;
		}
		p[++m] = mkp(t, cnt);
	}
	ll ans = 1;
	for (int i = 1; i <= m; ++i) {
		ans *= (p[i].scd * 2 + 1);
	}
	printf("%lld\n", (ans + 1) / 2);
}

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