#include "bits/stdc++.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;

const int MOD = 998244353;
const int N= 2e5 + 10;
int dp[500][N];
int solve(int places, int sum){
         if(sum == 0) return 1;
         if(sum < 0 || places < 0) return 0;
         int &ret= dp[places][sum];
         if(ret !=  -1)
                  return ret;

         int ch1= solve(places - 2, sum);
         int ch2= solve(places - 2, sum - places);
         return ret= (ch1 + ch2) % MOD;
}
int32_t main(){
         cin.tie(0);
         cin.sync_with_stdio(0);

         ::memset(dp, -1, sizeof dp);
         int T; cin>>T;
         while(T--)
         {
                  int n; cin>>n;
                  cout<<solve(499, n)<<"\n";
         }
}