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

const int N = 1e6+10,mo = 1e9+7;

int a[N];
int h(int x){
    return (x*(x+1)/2)%mo;
}
int f(int x){
    int k=x-1;
    int res=0;
    while(k>0){
        res+=k;k/=2;
    }
    return res+1;
}
int g(int x){
    int k=x-1,k2=1;
    int res=0;
    while(k>0){
        res+=h(k)*k2%mo;
        res%=mo;
        k/=2;
        k2=k2*2%mo;
    }
    return (res+1)%mo;
}


inline void solve(){
    int n;cin>>n;
    int l=2,r=1e18;
    while(l<r){
        int mid=l+r+1>>1;
        if(f(mid)<n)l=mid;
        else r=mid-1;
    }
    int x=l;
    if(f(x)>=n)x=1;
    int ans=(g(x)+(n-f(x))*x%mo)%mo;
    cout<<ans<<"\n";
    

}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}