#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 1000005
#define mod 1000000007
using namespace std;
typedef long long ll;
ll cas,n,i,j;
ll mi[N],ni[N];
ll ksm(ll x,ll y)
{
    ll ans=1;
    while (y)
    {
        if (y%2)ans=ans*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return ans;
}
int main()
{
    scanf("%I64d",&cas);
    mi[0]=1;for (i=1;i<N;i++)
        mi[i]=mi[i-1]*i%mod;
    for(ni[1]=1,i=2;i<N;i++)
        ni[i]=(mod-mod/i)*ni[mod%i]%mod;
    for(ni[0]=1,i=1;i<N;i++)
        (ni[i]*=ni[i-1])%=mod;
    while (cas--)
    {
        scanf("%I64d",&n);
        ll ans=0;
        for (i=0;i<=n>>1;i++)
            ans=(ans+mi[n+1]*ni[i]%mod*ni[i+1]%mod*ni[n-i*2]%mod)%mod;
        ans=ans*ksm(n+1,mod-2)%mod;
        printf("%I64d\n",ans);
    }
}