#include <stdio.h>
#include <map>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <set>
#include <ctime>
#include <bitset>

#define ll __int64
#define ull unsigned long long
#define MAXN 40010
#define INF 99999999
#define eps 1e-8
#define mod 1000000007
#define f_min(a,b) (a<b?a:b)

using namespace std;

ll inv[1000100],h[1000100];

void init(){
    int i,j;
    inv[1]=1;
    for (i=2;i<=1000000;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
    h[0]=1;
    for (i=1;i<=1000000;i++) h[i]=h[i-1]*(4*i-2)%mod*inv[i+1]%mod;
}

ll c[1000100];

int main(){
    init();
    int T,n,i;
    scanf("%d",&T);
    while (T--){
        scanf("%d",&n);
        c[0]=1;
        for (i=1;i<=n;i++){
            c[i]=c[i-1]*(n-i+1)%mod*inv[i]%mod;
        }
        ll ans=0;
        for (i=0;i*2<=n;i++){
            ans=(ans+c[i*2]*h[i])%mod;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}