#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define LL long long
#define mod 1000000007
#define fi first
#define se second
#define PLL pair<LL,LL>
#define mkp make_pair
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
LL rd() {
	LL res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
PLL yyh[100],wyf[100];
map<LL,PLL>mp;
PLL solve(LL n) {
	if(n==0) return mkp(0,0);
	if(n==1) return mkp(1,1);
	if(mp.find(n)!=mp.end()) return mp[n];
	LL tmp=1,cnt=0;
	while(tmp*2<n) tmp*=2,cnt++;
	if(tmp*2==n) {
		PLL C=solve(n-1);
		return mkp((C.fi+cnt+2)%mod,(C.se+n%mod*(cnt+2)%mod)%mod);
	}
	PLL A=solve(tmp-1),B=solve(n-tmp);
	return mp[n]=mkp((A.fi+B.fi+cnt+1)%mod,(A.se+tmp%mod*B.fi%mod+tmp%mod*(cnt+1)%mod+B.se)%mod);
}
PLL solve1(LL n) {
	if(n==0) return mkp(0,0);
	if(n==1) return mkp(1,1);
	LL tmp=1,cnt=0;
	while(tmp*2<n) tmp*=2,cnt++;
	if(tmp*2==n) return yyh[cnt+1];
	if(tmp*2-1==n) return wyf[cnt+1];
	PLL A=wyf[cnt],B=solve1(n-tmp);
	return mkp((A.fi+B.fi+cnt+1)%mod,(A.se+tmp%mod*B.fi%mod+tmp%mod*(cnt+1)%mod+B.se)%mod);
}
int T;
LL n;
int main() {
//	freopen("G.in","r",stdin);
//	freopen("G.out","w",stdout);
	rep(i,0,60) yyh[i]=solve((1ll<<i)),wyf[i]=solve((1ll<<i)-1);
	T=rd();
	while(T--) {
		n=rd();
		LL l=0,now=n-1;
		drep(i,60,0) if((1ll<<(i+1))-1<=now) l+=1ll<<i,now-=(1ll<<(i+1))-1;
		PLL tmp=solve1(l); 
		printf("%lld\n",(1+tmp.se+(l+1)%mod*(n%mod-1-tmp.fi+mod)%mod)%mod);
	}
	return 0;
}