#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#define LL long long
using namespace std;
const int M = 1e6 + 5, MOD = 1e9 + 7;
int A[M],B[M];;
int fast(int x,int y){
    int t=x,res=1;
    while(y){
        if(y&1) res=1LL*res*t%MOD;
        t=1LL*t*t%MOD;
        y>>=1;
    }
    return res;
}
int main() {
    int T;
    scanf("%d", &T);
    B[0]=B[1]=1;
    for(int j=2;j<M;j++){
        B[j]=1LL*(MOD-MOD/j)*B[MOD%j]%MOD;
    }
    A[0]=A[1]=1;
    for(int j=2;j<M;j++){
        A[j]=(1LL*(2*j+1)*A[j-1]%MOD+1LL*(3*j-3)*A[j-2]%MOD)%MOD;
        A[j]=1LL*A[j]*B[j+2]%MOD;
        A[j]=(A[j]+MOD)%MOD;
    }
    while(T--) {
        int n;
        scanf("%d",&n);
        printf("%d\n",A[n]);
    }
    return 0;
}