#include<bits/stdc++.h>

using namespace std;
const int N = 1e5 + 7;
typedef long long ll;
int tot;
int vis[N], prime[N];

void seive() {
    for (int i = 2; i < N; i++) {
        if (!vis[i])prime[++tot] = i;
        for (int j = 1; j <= tot && i * prime[j] < N; j++) {
            vis[i * prime[j]] = 1;
        }
    }
}

ll ans;

void dfs(int st, int cnt, vector<int> &p) {
//    cout<<cnt<<"\n";
    if (st == p.size()) {
        cnt=max(cnt-1,0);
        ans+=1<<cnt;
        return;
    }
    for(int i=0;i<=p[st];i++)dfs(st+1,cnt+(i!=0),p);
}

void solve() {
    ll n;cin>>n;
    vector<int> factor;
    for (int i = 1; i <= tot; i++) {
        if (n % prime[i] == 0) {
            int cnt = 0;
            while (n % prime[i] == 0) {
                cnt++;
                n /= prime[i];
            }
            factor.push_back(cnt);
        }
    }
    ans = 0;
    dfs(0, 0, factor);
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    seive();
    int T;
    cin >> T;
    while (T--)solve();
}