#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T,n;
LL f[1000005];
const LL mod=1e9+7;
LL powmod(LL a,LL b,LL c)
{
    LL ans=1;
    while  (b)
    {
        if (b%2==1) ans=ans*a%c;
        b/=2;
        a=a*a%c;
    }
    return ans;
}

int main()

{

    scanf("%d",&T);
    f[1]=1;
    f[2]=2;
    for (int i=3;i<=1000000;++i) 
    {
        f[i]=(2*i+1)*f[i-1]%mod;
        f[i]=f[i]+(3*i-3)*f[i-2]%mod;
        f[i]%=mod;
        f[i]*=powmod((i+2),mod-2,mod);
        f[i]%=mod;
    }
    while (T--)
    {
        scanf("%d",&n);
        printf("%d\n",f[n]);
    }

    return 0;

}