#include<bits/stdc++.h>
#define int long long
// #pragma GCC optimize (1)
// #pragma GCC optimize (2)
// #pragma GCC optimize (3)
#define deg(a) cout<<#a<<'='<<a<<"\n"
#define all(a) a.begin(),a.end()
#define lowbit(x)  ((x)&(-x))
#define find1(x)  (__builtin_popcount(x))
#define pll pair<int,int>
#define all(a) a.begin(),a.end()
#define db double
#define endl '\n'
#define ff first
#define ss second
#define lc p<<1
#define rc p<<1|1
using namespace std;
using i64 = long long;
const int N = 1e6+10;
const int M = 1e6+10;
const int mod1 = 998244353;
const int mod2 = 1e9+7;
const int INF = 0x3f3f3f3f3f3f3f;
const double eps = 1e-10;
void solve(){
     map<int,int>s;
     std::vector<int> v;
     int n;
     cin >> n;
     if(n == 1) {
         cout << 1 << endl;
         return;
     }
     int sum = 0;
     int ss = 1;
     for(int i = 2 ; i * i <= n ; i++) {
         if(n % i == 0) {
            v.push_back(i);
            while(n % i == 0) {
               n/=i;
               s[i]++;
            }
            sum++;
            ss *= s[i];
         }
     }
     if(n > 1) {
         if(s[n] == 0) {
            s[n] = 1;
            v.push_back(n);
            sum++;
            ss *= s[n];
         }
     }
     // v.push_back(1);
     // s[1] = 1;
     int cnt = (int)v.size();
     int ans = 0;
     for(int i = 0; i < (1ll << cnt); i++) {
         int res = 0;
         int sum1 = 1ll;
         for(int j = 0; j < cnt; j++) {
            if((i & (1ll<< (j))) != 0) {
               res++;
               sum1 *= s[v[j]];
            } 
         }
         if(res >= 2) {
            ans += sum1 * ((int)pow(2ll,res) - 2ll); 
         }
      }
      // deg(sum);
      // deg(ss);
      cout << ans / 2 + ss * ((int)pow(2,sum) - 1) + 1<< endl;
} 
signed main()
{  
   
   cin.tie(nullptr); 
   ios::sync_with_stdio(false); 
   int kk = 1;
   cin >> kk;
   // cin.get();
   while(kk--) solve();
   return 0;
}