#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
using i64 = long long;
const int N = 1e6 + 3, M = N;
int T;
i64 n, num, m;
int v[N], p[N];

void primes(int n){
	memset(v, 0, sizeof(v));
	m = 0;
	for(int i = 2; i <= n; ++i){
		if(v[i] == 0){
			v[i] = i; p[++m] = i;
		}
		for(int j = 0; j <= m; ++j){
			if(p[j] > v[i] or p[j] > n / i) break;
			v[i * p[j]] = p[j];
		}
	}
}

void work(){
	cin >> n;
	i64 ans = 1;
	for(int i = 1; n > 1 and (i64)p[i] * p[i] < n; ++i){
		int cnt = 0;
		while(n % p[i] == 0)
			cnt++, n /= p[i];
		ans *= (2 * cnt + 1); 
	}
	if(n > 1){
		ans *= 3;
	}
	cout << ans / 2 + 1 << "\n";
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	primes(N-2);
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}