#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second
#define ld long double
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define int long long
#define PII pair<pii , pii>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e7+10 + 10, inf = 1e9+10 , mod = 1e9 + 7 ;
int a2[maxn] , dp[70][70][130] ;
int po2(int b){
if(b==0)return 1 ;
if(b < maxn)return a2[b];
int v =po2(b/2);
v=v *v % mod ;
if(b&1) v= v*2% mod;
return v;
}
int po(int a,int b){
if(b==0)return 1 ;
int v =po(a,b/2);
v=v *v % mod ;
if(b&1) v= v*a % mod;
return v;
}
int ch(int x ,int d , int k){
if(d==-1)return 0;
d = min(d , k-x);
return ((1ll<<(d+1))-1);
}
int ans =0 , N , d[140] ;
void f(int n , int p = 1){
int x= p , k =0 ;
while(x*2 <= N){
k++;
x*=2 ;
}
if((x+(1ll<<k)-1) <= N){
rep(i , 0 , k){
int sm = 0 ;
rep(j , 0 , 2*k){
int t = dp[k][i][j] + (j >= i ? d[j-i] : 0);
if(t == N)break ;
sm = (sm + po2((N-t)%(mod-1))-1);
if(sm > mod)sm -= mod ;
}
sm += mod;
if(sm > mod)sm-=mod;
ans = (ans + sm*po2(i))%mod ;
}
return ;
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
a2[0] = 1;
rep(i , 1 ,maxn-1){
a2[i] = a2[i-1]*2%mod ;
}
rep(k , 0 , 60){
rep(i , 0 , k){
rep(d , 0 , 2*k+2){
int ans = ch(i , d , k) ;
int x = i-1 , D = d-1 ;
while(x!=-1 && D!=-1){
ans++ ;
ans = (ans + ch(x+1 , D-1 , k));
D--;
x--;
}
dp[k][i][d] = ans ;
}
}
}
int T ;
cin >> T ;
while(T--){
rep(i ,0 , 120)d[i] =0 ;
int n;
cin >> n ;
N = n ;
ans =0 ;
f(n);
cout << ans * po(po(2,n)-1 , mod-2)%mod << "\n";
}
return 0 ;
}
/*
*/
