M=998244353
N=2*10**6
fa=[1]
for i in range(1,N+1):
  fa+=[fa[-1]*i%M]
fb=[pow(fa[N],M-2,M)]
for i in reversed(range(1,N+1)):
  fb+=[fb[-1]*i%M]
fb.reverse()
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k>=0 else 0
g=lambda h,w:(fc(h+w,h)-fc(h+w,h-1))%M if h>0 and w>0 else 1
T=int(input())
for _ in range(T):
  n=int(input())
  if n%2:
    print(0)
    continue
  n//=2
  a=0
  for i in range(n):
    for j in range(i):
      a+=g(j,i)*g(n-i-1,n-j-1)*(i-j)
      a%=M
  print(a)