#include<bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(),(a).end()
using namespace std;

#define int ll
const int mod = 1e9 + 7;
const int N = 2e5 + 10;

ll get(ll n)
{
	ll x=(1ll<<62);
    // cerr << x << "\n";
	ll sum=0;
	while (n && x>=1)
	{
		if (n>=(x-1)) 
		{
			n=n-(x-1);
			sum+=x/2;
		}
		x=x/2;
	}
	return sum;
}

int Num[100];

ll qpow(ll base, ll pow)
{
    ll res = 1;
    while(pow)
    {
        if(pow & 1) res = res * base % mod;
        pow >>= 1;
        base = base * base % mod;
    }
    return res;
}

void add(int &a, int b){
    a = (a + b) % mod;
}
int cntt=0;
int pw2[100];
void solve()
{
    cntt++;
	ll n;
	cin >> n;

    // if (cntt==10001) cout << n << "\n";
    ll mx=get(n-2) + 1;
	int x = mx;
	int len = 0;
	while(mx)
	{
		Num[++len] = mx % 2;
		mx /= 2;	
	}
	
    // cerr << x << '\n';//1100
	int ans = 0;
    int res = 0;
    int inv2 = qpow(2, mod - 2);
	for(int i = len; i >= 1; i--)
    {
        res = res * 2 + Num[i];
        int tmp = res;
        // cerr << tmp << "\n";
        int sum;
        tmp=res%mod;
        if(res % 2){
            sum = (1 + tmp) % mod * (1 + tmp) % mod * inv2 % mod * inv2 % mod;
            // cout << 1+res << "\n";
        }
        else{
            tmp--;
            tmp=(tmp+mod)%mod;
            sum = (1 + tmp) % mod * (1 + tmp) % mod * inv2 % mod * inv2 % mod;
            // cout << 1+tmp << "\n";
        }
        sum = sum * pw2[i - 1] % mod;
        // cerr << i <<" " << ans << " " << sum <<" " << pw2[i-1] << "\n";
        add(ans, sum * i % mod);
    }
	
	int p = n + 1;
    int xx=x%mod;
	while(get(p - 2) + 1 == x)
	{

		ans = (ans - xx + mod) % mod;
        // cerr << ans << " " << x <<  "\n";
		p++;
	}
	cout << (ans + 1) % mod << '\n';
}

signed main()
{
	
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t = 1;
    pw2[0] = 1;
    for(int i = 1; i < 100; i++) pw2[i] = pw2[i - 1] * 2 % mod;
    cin >> t; 
    while(t--) solve();
    return 0;
}