#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<bitset>

#define ls (t<<1)
#define rs ((t<<1)+1)
#define mid ((l+r)>>1)
#define fi first
#define se second
#define mk make_pair

#define N 2000005
#define M 200005
#define seed 23333
#define Mo 1000000007

using namespace std;
int i,j,m,n,p,k,fac[N],inv[N],Inv[N],T,F[N];
int power(int x,int y)
{
      int sum=1;
      for (;y;y>>=1)
      {
            if (y&1) sum=1ll*sum*x%Mo;
            x=1ll*x*x%Mo;
      }
      return sum;
}
int C(int x,int y)
{ 
 return 1ll*fac[x]*inv[y]%Mo*inv[x-y]%Mo;
}
void jia(int &x,int y)
{
     x+=y; if (x>=Mo) x-=Mo;
} 
int main()
{
      scanf("%d",&T);
      fac[0]=1;
      for (i=1;i<N;++i) fac[i]=1ll*fac[i-1]*i%Mo;
      for (i=1;i<1000005;++i) Inv[i]=power(i,Mo-2); 
      inv[N-1]=power(fac[N-1],Mo-2);
      for (i=N-1;i;--i)
        inv[i-1]=1ll*inv[i]*i%Mo;
      for (i=0;i<1000005;i+=2) F[i]=C(i,i/2);  
      for (;T--;)
      {
         scanf("%d",&n);
         int ans=0;
         for (i=0;i<=n;i+=2)
              jia(ans,1ll*F[i]*Inv[i/2+1]%Mo*C(n,i)%Mo);
          printf("%d\n",ans);
       }
}