#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define maxn 1000010
#define ll long long
#define Mod 1000000007
using namespace std;

ll n;
ll ANTI[maxn];

void exgcd ( ll a, ll b, ll &x, ll &y )
{
    if ( !b ) { x = 1, y = 0; return ; }
    exgcd(b,a%b,x,y);
    ll t = x; x = y; y = t-a/b*y;
}

ll Anti ( ll a )
{
    ll x, y; exgcd(a,Mod,x,y);
    x %= Mod; if ( x < 0 ) x += Mod;
    return x;
}

int main ()
{
    for ( ll i = 1; i <= maxn-10; i ++ ) ANTI[i] = Anti(i);
    int T; scanf ( "%d", &T );
    while ( T -- )
    {
        scanf ( "%I64d", &n );
        ll Ans = 1, ANS = 1;
        for ( ll x = 1; x <= n/2; x ++ )    
        {
            Ans *= (n-2*x+1), Ans %= Mod;
            Ans *= (n-2*x+2), Ans %= Mod;    
            Ans *= ANTI[x], Ans %= Mod;
            Ans *= ANTI[x+1], Ans %= Mod;
            ANS += Ans; ANS %= Mod;
        }
        printf ( "%I64d\n", ANS );
    }
    return 0;
}