#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

template<typename T>
vector<T> smallest_prime_factors(T n) {
  vector<T> spf(n+1);
  for (int i = 0; i <= n; ++i) spf[i] = i;
  for (T i = 2; i * i <= n; ++i) {
    if (spf[i] == i) {
      for (T j = i * i; j <= n; j += i) {
        if (spf[j] == j) spf[j] = i;
      }
    }
  }
  return spf;
}

int main() {
  vector<int> cnt(20);
  rep(k,0,20) {
    rep(a,0,k+1) rep(b,0,k+1) rep(d,0,k+1) rep(e,0,k+1) {
      int c = k-a-b, f = k-d-e, g = k-a-d, h = k-b-e;
      int i1 = k-c-f, i2 = k-g-h;
      if (c >= 0 && f >= 0 && g >= 0 && h >= 0 && i1 >= 0 && i1==i2) {
        ++cnt[k];
      }
    }
  }
  // rep(k,0,20) cout << cnt[k] << " ";
  // cout << endl;
  vector<int> spf = smallest_prime_factors(1000010);
  int t;
  cin >> t;
  while(t--) {
    int k;
    cin >> k;
    map<int,int> mp;
    while(k > 1) {
      ++mp[spf[k]];
      k /= spf[k];
    }
    ll ans = 1;
    for (auto [p, e] : mp) {
      ans *= cnt[e]; ans %= 998244353;
    }
    cout << ans << endl;
  }
  return 0;
}