#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;
}
unordered_map<LL,int>MP;
map<LL,PLL>mp;
LL hight_bit(LL x)
{
    x= x|(x>>1);
    x= x|(x>>2);
    x= x|(x>>4);
    x= x|(x>>8);
    x= x|(x>>16);
    x= x|(x>>32);
    return (x+1) >> 1;
}
PLL G[10000010];
PLL solve(LL n) {
	if(n==0) return mkp(0,0);
	if(n==1) return mkp(1,1);
	if(n<=10000000&&G[n].fi!=0) return G[n];
	if(mp.count(n)) return mp[n];
	LL tmp=hight_bit(n),cnt=MP[tmp];
	
	if(tmp*2==n) {
		PLL C=solve(tmp-1);
		return mkp((C.fi*2+cnt*2+3)%mod,(C.se*2+n%mod*(cnt+2)+tmp%mod*(cnt+1)+tmp%mod*C.fi)%mod);
	}
	PLL A=solve(tmp-1),B=solve(n-tmp);
	if(n<=10000000) return G[n]=mkp((A.fi+B.fi+cnt+1)%mod,(A.se+tmp%mod*B.fi+tmp%mod*(cnt+1)+B.se)%mod);
	return mp[n]=mkp((A.fi+B.fi+cnt+1)%mod,(A.se+tmp%mod*B.fi+tmp%mod*(cnt+1)+B.se)%mod);
}
int T;
LL n;
int main() {
	LL x=1;
	rep(i,1,62) x*=2,MP[x]=i;
	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=solve(l); 
		printf("%lld\n",(1+tmp.se+(l+1)%mod*(n%mod-1-tmp.fi+mod)%mod)%mod);
	}
	return 0;
}