#include <bits/stdc++.h>
#define int int64_t

using std::cin;
using std::cout;
const char endl = '\n';

std::vector<int> prime;
bool not_prime[(int)1.1E5];

void solve() {
  int n;
  cin >> n;
  int ans = 1;
  for(auto &p : prime) {
    int cnt = 0;
    while(n % p == 0) {
      n /= p;
      cnt++;
    }
    ans *= cnt * 2 + 1;
  }
  if(n != 1) ans = 3;
  cout << (ans / 2 + 1) << endl;
}

void init() {
  for(int i = 2; i < (int)1.1E5; ++i) {
    if(!not_prime[i]) prime.push_back(i);
    for(auto &p : prime) {
      if(p * i >= (int)1.1E5) break;
      not_prime[p * i] = true;
      if(i % p == 0) break;
    }
  }
}

int32_t main(){
  init();
#ifndef _DEBUG
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif
  int tc = 1;
  std::cin >> tc;
  while(tc--) solve();
#ifdef _DEBUG
  std::cout << std::endl;
  std::cout << "Time used: " << clock() << "ms" << std::endl;
  system("pause");
  return 0;
#endif
}