#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>

using namespace std;

typedef long long LL;

const LL Mod = 1000000007;

const int Max = 1100000;

LL Inv[Max];

LL ans[Max];

LL Pow(LL n,LL m)
{
    LL ans = 1;

    while(m)
    {
        if(m%2)
        {
            ans = (ans*n)%Mod;
        }

        n = (n*n)%Mod;

        m>>=1;
    }
    return ans;
}

void Init()
{
    for(int i = 1;i<Max;i++)
    {
        Inv[i] = Pow(i,Mod-2);
    }
}

int main()
{
    Init();

    ans[1]  =1;

    ans[0] = 1;

    for(LL i = 2;i<Max;i++)
    {
        ans[i]  = ((((2*i+1)*ans[i-1])%Mod+(((3*i-3)*ans[i-2])%Mod))*Inv[i+2])%Mod;
    }

    int n;

    int T;

    cin>>T;

    while(T--)
    {
        cin>>n;

        cout<<ans[n]<<endl;
    }
    return 0;
}