#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 4000000000000000001LL
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
combi C(3000005);
int main(){
	vector<mint> f(1000005);
	rep(i,f.size()-1)f[i+1] = C.catalan(i) * (i*2+1);
	vector<mint> g(1000005);
	rep(i,g.size()){
		g[i] = C.catalan(i) * (i*2+1);
	}
	f = convolution(f,g);
	int _t;
	cin>>_t;
	rep(_,_t){
		int n;
		cin>>n;
		if(n%2==1){
			cout<<0<<endl;
			continue;
		}
		n /= 2;
		mint ans = f[n-1];
		cout<<ans.val()<<endl;
	}
	return 0;
}