#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int64_t n;
  IN(n);
  static map<int64_t, int64_t> memo;
  if (memo.contains(n)) {
    OUT(memo[n]);
    return;
  }
  map<int64_t, int> f;
  for (int64_t i = 2; i <= n; ++i) {
    if (i * i > n) {
      i = n;
    }
    while (n % i == 0) {
      f[i]++;
      n /= i;
    }
  }
  int64_t ans = 1;
  for (int64_t e : f | views::values) {
    ans *= 2 * e + 1;
  }
  ++ans;
  ans /= 2;
  OUT(memo[n] = ans);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define IN(...) cin >> forward_as_tuple(__VA_ARGS__)
#define OUT(...) cout << forward_as_tuple(__VA_ARGS__) << '\n'

#endif  // __INCLUDE_LEVEL__ == 1