//  _                          _   _                            
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___ 
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//                                                              
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>

using namespace std;
#define int long long
#define endl "\n"
const int N = 1e5 + 10, M = 1e5 + 10, inf = 1e9;
typedef pair<int, int> PII;
int n, m;

void solve() {
    cin>>m;
    vector<int>a;
    for(int i = 1;i * i <= m;i ++){
        if(m%i==0){
            a.push_back(i);
            a.push_back((m/i));
        }
    }
    sort(a.begin(),a.end());
    a.erase(unique(a.begin(),a.end()),a.end());
    vector<PII>b;
    for(int i = 0;i < a.size();i ++){
        for(int j = i;j < a.size();j ++){
            int tem = __gcd(a[i],a[j]);
            b.push_back({a[i]/tem,a[j]/tem});
        }
    }
    sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());
    cout<<b.size()<<endl;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}