#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#define LL long long
#define INF 0x3f3f3f3f
#define Mod 1000000007
using namespace std;
const int maxn = 1e6+100;
long long extend_gcd(long long a,long long b,long long &x,long long &y)
{
    if(a==0&&b==0) return -1;//无最大公约数
    if(b==0){x=1;y=0;return a;}
    long long d=extend_gcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
//*********求逆元素*******************
//ax = 1(Mod n)
long long Mod_reverse(long long a,long long n)
{
    long long x,y;
    long long d=extend_gcd(a,n,x,y);
    if(d==1) return (x%n+n)%n;
    else return -1;
}

LL power(LL a,LL b)
{
    LL ans = 1;
    a %= Mod;
    while(b)
    {
        if(b & 1)
        {
            ans = ans * a % Mod;
            b--;
        }
        b >>= 1;
        a = a * a % Mod;
    }
    return ans;
}
long long  a[maxn] = {1,1};
int main()
{
    for(int i=2; i<maxn; i++){
        a[i] = ((2*i+1)*a[i-1]) % Mod;
        a[i] = (a[i] + ((3*i-3)*a[i-2])%Mod) % Mod;
        a[i] = (a[i] * power(i+2, Mod-2)) % Mod;

    }
    int T, n;
    scanf("%d",&T);
    while(T--)
    {
        cin>>n;
        cout<<a[n]<<endl;
    }
}