/*
枚举横边数量，可以任意插入。
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int md=1e9+7;
int ftl[2100000],itl[2100000];
int quickPow(int x,int k)
{
	int ans=1;
	for(;k;k>>=1,x=x*x%md)
	{
		if(k&1)
			ans=ans*x%md;
	}
	return ans;
}
void getFactorial(const int lim=2e6+10)
{
	ftl[0]=1;
	for(int i=1;i<=lim;i++)
		ftl[i]=ftl[i-1]*i%md;
	itl[lim]=quickPow(ftl[lim],md-2);
	for(int i=lim-1;i>=0;i--)
		itl[i]=itl[i+1]*(i+1)%md;
}
int C(int n,int m)
{
	// cout<<"C "<<n<<" "<<m<<endl;
	return n<m?0:(ftl[n]*(itl[m]*itl[n-m]%md)%md);
}
int P(int x,int y)
{
	assert((x+y)%2==0);
	int a=(x+y)/2,b=(x-y)/2;
	// cout<<"P x="<<x<<" y="<<y<<" = C("<<a+b<<","<<b<<")"<<endl;
	return C(a+b,b);
}
int solve(int n) // (0,0) -> (n,0)
{
	int ans=0;
	for(int i=n%2;i<=n;i+=2)
	{
		ans=(ans+C(n,i)*((P(n-i,0)-P(n-i,-2)+md)%md)%md)%md;
	}
	return ans;
}
signed main()
{
	getFactorial();
	int T;
	cin>>T;
	for(int _=1;_<=T;_++)
	{
		int n;
		cin>>n;
		cout<<solve(n)<<'\n';
	}
}
/*
3
3
1000
1000000
*/