#include<bits/stdc++.h>
#define ll long long
#define rll register ll
#define ri register int
#define fo(i,x,y) for(ri i=(x);i<=(y);++i)
#define fu(i,x,y) for(ri i=(x);i<(y);++i)
#define fd(i,x,y) for(ri i=(x);i>=(y);--i)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N=1e5+5,p=1e9+7;
int T;ll n;
map<ll,int>f,pre,suf;
//int f[N],pre[N],suf[N];
inline void dfs(rll n){
	if(f[n])return;
	rll r=n/2,l=n-r;
	dfs(l);dfs(r);
	f[n]=(((f[l]+f[r])%p+1ll*r%p*suf[l]%p)%p+1ll*l%p*pre[r]%p-1)%p;
	(f[n]+=p)%=p;
	pre[n]=1ll*(pre[l]+r-1+pre[r])%p;
	suf[n]=1ll*(suf[r]+l-1+suf[l])%p;
}
int main(){
	scanf("%d",&T);
	f[1]=pre[1]=suf[1]=1;
	while(T--){
		scanf("%lld",&n);
		dfs(n);
		printf("%d\n",f[n]);
	}
	cerr<<endl<<endl<<"time:"<<(double)clock()/CLOCKS_PER_SEC<<endl;
}