#include<bits/stdc++.h>
using namespace std;
const int P=1e9+7;
struct node{
	int sz,dp[61];
}O;
node f[31];
int T,n,cnt,sz[61],ls[61],rs[61],id[61],inv[61][61],tot,rt,nw;
inline int md(int x){
	return x>=P?x-P:x;
}
int ksm(int x,int y){
	int res=1;
	for(;y;y>>=1,x=1ll*x*x%P)if(y&1)res=1ll*res*x%P;
	return res;
}
inline node operator +(node a,node b){
	node c=O;
	c.sz=nw;
	c.dp[0]=1ll*a.dp[0]*b.dp[0]%P;
	int i=1,j=1;
	c.dp[c.sz]=1ll*a.dp[0]*b.dp[0]%P;
	for(int i=1;i<=cnt;++i)if(sz[i]<sz[c.sz])c.dp[i]=(1ll*a.dp[i]*b.dp[0]+1ll*b.dp[i]*a.dp[0])%P;
	for(int i=0;i<=cnt;++i)if(c.dp[i]&&i!=c.sz)c.dp[i]=1ll*c.dp[i]*inv[c.sz][i]%P;
	return c;
}
struct val{
	int w,i,j;
};
inline void Inv(bool fg=false){
	vector<val>tmp;
	for(int i=0;i<=cnt;++i)for(int j=0;j<=cnt;++j)if((fg||i>30||j>30)&&sz[i]>sz[j])tmp.emplace_back(val{sz[i]-sz[j],i,j});
	if(tmp.empty())return;
	for(int i=1;i<tmp.size();++i)tmp[i].w=1ll*tmp[i].w*tmp[i-1].w%P;
	tmp.back().w=ksm(tmp.back().w,P-2);
	for(int i=tmp.size()-1;~i;--i){
		int u=tmp[i].w;
		if(i)tmp[i].w=1ll*u*tmp[i-1].w%P;
		inv[tmp[i].i][tmp[i].j]=tmp[i].w;
		if(i)tmp[i-1].w=1ll*u*(sz[tmp[i].i]-sz[tmp[i].j])%P;
	}
}
void init(){
	for(int i=0;i<=30;++i)sz[i]=(1<<i)-1;
	cnt=30,Inv(true);
	f[0].sz=1,f[0].dp[0]=f[0].dp[1]=1;
	for(int i=1;i<30;++i)nw=i+1,f[i]=f[i-1]+f[i-1];
}
void getinv(int n,int &x){
	x=++tot;
	if(!n)return;
	int t=1,o=0;
	while(2*t+1<=n)t=2*t+1,++o;
	if(t==n)return;
	else id[x]=++cnt,sz[cnt]=n;
	if((n-t-1)<(t>>1))t>>=1;
	getinv(t,ls[x]),getinv(n-t-1,rs[x]);
}
node calc(int n,int x){
	if(!n){
		node a=O;
		a.sz=0,a.dp[0]=1;
		return a;
	}
	int t=1,o=0;
	while(2*t+1<=n)t=2*t+1,++o;
	if(t==n)return f[o];
	if((n-t-1)<(t>>1))t>>=1;
	node L=calc(t,ls[x]),R=calc(n-t-1,rs[x]);
	nw=id[x];
	return L+R;
}
void solve(){
	scanf("%d",&n);
	for(int i=0;i<=tot;++i)ls[i]=rs[i]=id[i]=0;
	for(int i=31;i<=cnt;++i)sz[i]=0;
	cnt=30,rt=tot=0;
	getinv(n,rt),Inv();
	node res=calc(n,rt);
	int ans=0;
	for(int i=1;i<=cnt;++i)if(res.dp[i])ans=md(ans+res.dp[i]);
	printf("%d\n",1ll*ans*ksm(n,P-2)%P);
}
int main(){
	scanf("%d",&T);
	init();
	while(T--)solve();cerr<<1000*clock()/CLOCKS_PER_SEC<<endl;
	return 0;
}