#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cassert>
#define ll long long
using namespace std;
const ll mod=1000000007;
ll calc(ll x){
  ll res=0;
  while(x>0){
   res=res+x;
   x>>=1;
  }
  return res;
}
ll solve(ll n){
  ll l=n/2,r=n,mid,ans=r;
  while(l<=r){
     mid=(l+r)/2;
     if(calc(mid)>=n)ans=mid,r=mid-1;
     else l=mid+1;
  }
  return ans;
}
ll Ko_ye(ll n){
  if(n==0)return 0;
  if(n==1)return 1;
  ll res=0;
  if(n%2==0)res=((n/2)%mod)*((n+1)%mod)%mod;
  else res=(((n+1)/2)%mod)*(n%mod)%mod;
  assert(res>=0);
  return (res+2*Ko_ye(n/2))%mod;
}
int T;
int main(){
  scanf("%d",&T); 
	ll n;
  while(T--){
	 
    cin>>n;
    //cout<<n<<endl;
    if(n==1){puts("1");}
    else{
      n--;
      ll K=solve(n);
      //cout<<K<<endl;
      ll ans=(n-calc(K-1))%mod*(K%mod)%mod;
      ans=(ans+(ll)Ko_ye(K-1))%mod;
      ans=(ans+mod)%mod;
      (ans += 1) %= mod;
      printf("%lld\n",(long long)ans);

    }
  }
}