#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int mod=1e9+7;
ll n;
ll sum(ll x){
	ll res=1;
	for(int i=60;i>=0;--i){
		ll k=x>>i;
		k=(k+1)>>1;
		res+=k*(i+1);
	}
//	cout<<x<<' '<<res<<'\n';
	return res;
}
ll calc(ll x){
	ll res=1;
	for(int i=60;i>=0;--i){
		ll k=(((x>>i)+1)>>1)%mod;
		res+=k*k%mod*((1ll<<i)%mod)%mod*(i+1)%mod;
	}
	return res;
}
void solve(){
	cin>>n;
	ll l=1,r=n,mid,ans=0;
	while(l<=r){
		mid=(l+r)>>1;
		if(sum(mid)<=n)l=mid+1,ans=mid;
		else r=mid-1;
	}
	//cout<<ans<<'\n';
	cout<<(calc(ans)+(n-sum(ans))*((ans+1)%mod)%mod)%mod<<'\n';
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int T;
	cin>>T;
	while(T--)solve();
}