#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mkp make_pair
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

LL n;
vector<LL> p;

void sieve() {
	const int n = 1e5;
	bitset<n+1> vis;
	For(i,2,n) {
		if( !vis[i] ) p.pb(i);
		for(int j = 0; i*p[j] <= n; ++j) {
			vis[i*p[j]] = 1;
			if( !(i % p[j]) ) break;
		}
	}
}

void MAIN() {
    cin>>n;
	LL ans = 1;
	for(int i = 0; i < sz(p) && p[i]*p[i] <= n; ++i) if( !(n % p[i]) ) {
		int cnt = 0;
		for(; !(n % p[i]); n /= p[i]) ++cnt;
		ans *= 2 * cnt + 1;
	}
	if( n > 1 ) ans *= 3;
	cout<<(ans+1)/2<<'\n';
} signed main() {
#ifdef FS
    freopen("in","r",stdin); freopen("out","w",stdout);
#endif
    ios::sync_with_stdio(0);cin.tie(0);
	sieve();
    int lft=read(); while( lft-- ) {
        MAIN();
    }
    return 0;
}