#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define db long double

const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;

int a[maxn], pow2[100];

int lowbit(int x) {
    return x & (-x);
}

void init() {
    pow2[0] = 1;
    for(int i = 1; i <= 63; i++) {
        pow2[i] = pow2[i - 1] * 2;
    }
}

int n, ans;
int cnt[100];
int pos = 0;

bool check(int x) {
    int now = 1, pre = 0;
    for (int i = pos; i >= 0; i--) {
        cnt[i] = (x / pow2[i] - pre);
        now += (i + 1) * (x / pow2[i] - pre);
        pre += cnt[i];
    }
    if (now >= n) {
        return false;
    } else {
        return true;
    }
}

void solve() {
    cin >> n;
    int l = 1, r = n;
    pos = 0;
    int now = n;
    while(now != 0) {
        pos++;
        now /= 2;
    }
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (check(mid)) {
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    int an = l - 1;
    int ans = 1;
    int pre = 1;
    for(int i = 0; i <= pos; i++) {
        int cnt1 = 0;
        if(pos != 63) cnt1 = (an + 1) / pow2[i] - (an + 1) / pow2[i + 1];
        else cnt1 = (an + 1) / pow2[i];
        int beg = pow2[i];
        int end = ((cnt1 - 1) % mod * pow2[i] * 2 % mod) + pow2[i];
        ans = (ans + (i + 1) % mod * (((beg + end) / 2) % mod * cnt1) % mod) % mod;
        pre += cnt1 * (i + 1);
    }
    ans = (ans - ((pre - n + mod) % mod * (an + 1) ) % mod + mod) % mod;
    cout << ans << '\n';
}

signed main(){
    io;
    init();
    int T = 1;
    // T = read();
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}