#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<class... T>
constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class... T>
constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


//わかってないけどカスのサンプルエスパーしたかも
void p(int k){
  ll a=0;
  while(k%2==0){
    k/=2,a++;
  }
  // cout<<a<<"a\n";
  mint ans=1;
  ans*=((a+1)*(a+2)/2)*((a+1)*(a+2)/2+1)/2;
  ll i=3;
  while(k!=1){
    a=0;
    while(k%i==0){
      k/=i,a++;
    }
    // cout<<a<<"a\n";
    ans*=((a+1)*(a+2)/2)*((a+1)*(a+2)/2+1)/2;
    i+=2;
  }
  cout<<ans.val()<<"\n";
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  
  ll t,n;
  cin>>t;
  for(ll T=0;T<t;T++){
    cin>>n;
    p(n);
  }
}