/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;
int dp[100005][320];

int solve(int n, int k) {
    if (n == 0)return 1;
    if (n < 0 || k == 0)return 0;
    int &ret = dp[n][k];
    if (~ret)return ret;
    return ret = (solve(n - k, k) + solve(n, k - 1)) % MOD;
}

void doWork() {

    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i * i <= n; i++) {
        if ((n - i * i) & 1 ^ 1) {
            ans = (ans + solve((n - i * i) / 2, i)) % MOD;
        }
    }
    cout << ans << '\n';

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    memset(dp, -1, sizeof dp);

    int t = 1;
    cin >> t;
    while (t--) {
        doWork();
    }
}