#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

typedef long long LL;

const LL mod=1e9+7;
const int maxn=1000010;

LL f[maxn];

LL pp(LL a,LL b){
    if(!b) return 1;
    LL cnt=pp(a,b/2);
    cnt=cnt*cnt%mod;
    if(b&1) cnt=cnt*a%mod;
    return cnt;
}

void init(){
    f[0]=f[1]=1;
    for(int i=2; i<maxn; ++i){
        f[i]=(i*2ll+1)*f[i-1]%mod+(3*i-3)*f[i-2]%mod;
        f[i]=f[i]*pp(i+2,mod-2)%mod;
        f[i]=(f[i]%mod+mod)%mod;
    }
}

void work(){
    int n;
    scanf("%d",&n);
    cout<<f[n]<<endl;
}

int main(){
    init();
    int kase;
    scanf("%d",&kase);
    while(kase--) work();
    return 0;
}