/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<20;
LL fac[SIZE],CC[1024][1024];
LL mypow(LL x,LL y){
    x%=MOD;
    LL a=1%MOD;
    while(y){
        if(y&1)a=a*x%MOD;
        y>>=1;
        x=x*x%MOD;
    }
    return a;
}
//1-base
struct Difference{
    LL a[SIZE],cc[SIZE];
    int n;
    void build(LL _a[],int _n){
        fac[0]=1;
        REPP(i,1,SIZE)fac[i]=fac[i-1]*i%MOD;
        n=_n;
        REPP(i,1,n+1)a[i]=_a[i];
        REPP(i,1,n+1){
            cc[i]=mypow(fac[i-1]*fac[n-i],MOD-2)*a[i]%MOD;
            if((n-i)%2==1)cc[i]=(MOD-cc[i])%MOD;
        }
    }
    LL get(LL x){
        x%=MOD;
        if(x<=n)return a[x];
        LL an=0;
        LL tmp=1;
        REPP(i,1,n+1)tmp=tmp*(x-i)%MOD;
        REPP(i,1,n+1){
            ADD(an,tmp*mypow(x-i,MOD-2)%MOD*cc[i]);
        }
        return an;
    }
}D,D2;
const int BB=80;
LL a[SIZE],b[SIZE];
void dfs(int x,LL v1,int v2){
    if(x==5){
        for(int i=v2;i<=BB;i+=2){
            a[i]+=v1*CC[(i-v2)/2+4][4];
        }
        return;
    }
    FOR(i,1,BB-v2){
        dfs(x+1,v1*i%MOD,v2+i);
    }
}
void build(){
    REP(i,1024){
        CC[i][0]=1;
        REPP(j,1,1024){
            CC[i][j]=CC[i-1][j-1]+CC[i-1][j];
            if(CC[i][j]>=MOD)CC[i][j]-=MOD;
        }
    }
    dfs(0,1,0);
    FOR(i,1,BB)ADD(a[i],a[i-1]);
    FOR(i,1,BB/2)b[i]=a[i*2-1];
    FOR(i,1,BB/2)a[i]=a[i*2];
}
int main(){
    build();
    D.build(a,BB/2);
    D2.build(b,BB/2);
    CASET{
        int n;
        R(n);
        if(n<5)W(0);
        else if(n%2==0)W(D.get(n/2));
        else W(D2.get((n+1)/2));
    }
    return 0;
}


Measured memory_bytes: 20220