#include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod=1e9+7;
int n,l,r,ans;
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void solve(){
	n=read()-1;l=0;r=n;
	while (l<=r){
		int mid=l+r>>1,sum=0;
		for (int i=0;i<=60;i++) sum+=mid>>i;
		if (sum<=n) ans=mid,l=mid+1; else r=mid-1;
	} int sum=1;
	for (int i=0,tmp;i<=60;i++)
		tmp=(ans>>i)%mod,sum=(sum+tmp*(tmp+1)/2%mod*(1ll<<i))%mod,n-=ans>>i;
	printf("%lld\n",(sum+(ans+1)%mod*n)%mod);
}
signed main(){int T=read();while (T--) solve();return 0;}
/*#include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod=1e9+7;
int n,ans,sum,sum1[64],sum2[64];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void init(){
	// for (int i=1;i<=8;i++){
	// 	for (int j=1;j<=__builtin_ctz(i)+1;j++)
	// 		cerr<<i<<", ";
	// } cerr<<endl;
	for (int i=1;i<=60;i++)
		sum1[i]=sum1[i-1]*2+i,
		sum2[i]=(sum2[i-1]*2+(1ll<<i-1)%mod*(sum1[i-1]%mod+i))%mod;
	for (int i=0;i<=60;i++) cerr<<i<<":"<<sum1[i]<<','<<sum2[i]<<endl;
}
void solve(){
	n=read()-1;ans=1;sum=0;
	for (int i=60;~i;i--)
		if (n>=sum1[i]){
			n-=sum1[i];
			ans=(ans+sum2[i]+sum1[i]*sum)%mod;
			sum=(sum+(1ll<<i))%mod;
		}
	// for (int i=1;1;i++){
	// 	int tmp=__builtin_ctz(i)+1;
	// 	if (n>=tmp) ans+=tmp*i,n-=tmp;
	// 	else {ans+=n*i;break;}
	// }
	printf("%lld\n",ans);
}
signed main(){init();int T=read();while (T--) solve();return 0;}*/