#include<bits/stdc++.h>
using namespace std;
const long long mod=1997;
int t,n,ma;
long long ans,C[1010][1010];
void chu() 
{
	for(int i=0;i<=1000;i++) 
    {
       C[i][0]=1; 
    }
	for(int i=1;i<=1000;i++)
	{
	    for(int j=1;j<=i;j++)
        {
            C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
        } 
    }	
}
int main()
{
	freopen("diary.in","r",stdin);
	freopen("diary.out","w",stdout);
	chu();
	scanf("%d",&t);
	while(t--)
	{
		ans=0;
		scanf("%d",&n);
		if(n&1)
		{
			printf("0\n");
			continue;
		}
		for(int i=0;i<=n/2;i++)
		{
			ans=(ans+(((C[n][i]*C[n-i][n/2-i])%mod)*C[n/2][i])%mod)%mod;
		}
		printf("%lld\n",ans);
	}
	return 0;
}