#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int c[100]={0,1,5,15,35,70,126,210,330,495,715};
int ksm(int a,int b){
    int ans=1;
    while(b){
        if(b&1)ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans%mod;
}
int f(int x,int n){//n阶多项式
    int ans=0;
    for(int i=1;i<=n+1;i++){//
        int fz=c[i];//y(i)
        int fm=1;
        for(int j=1;j<=n+1;j++){
            if(j==i)continue;
            fz*=(x-j);
            fm*=(i-j);
        }
        ans+=fz*ksm(fm,mod-2);
        ans%=mod;
    }
    return ans;
}
signed main(){
    int t,x;
    cin>>t;
    for(int i=1;i<=t;i++){
        // x=i;
        cin>>x;
        cout<<f(x,4)<<endl;
        // if(i==t)cout<<"\n";
        // else cout<<",";
    }
    return 0;
}