#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 __int128
#define db long double

inline __int128 read()
{
    __int128 x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch - '0');
        ch = getchar();
    }
    return x * f;
}
void print(__int128 x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
        print(x / 10);
    putchar(x % 10 + '0');
}

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 <= 64; i++) {
        pow2[i] = pow2[i - 1] * 2;
    }
}

int n, ans;
int cnt[100];

bool check(int x) {
    int now = 1, pre = 0;
    for (int i = 63; 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() {
    n = read();
    for(int i = 0; i <= 63; i++) {
        cnt[i] = 0;
    }
    int l = 1, r = n / 2 + 100;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (check(mid)) {
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    int an = l - 1;
    // cerr << an << '\n';
    int ans = 1;
    int pre = 1;
    for(int i = 0; i <= 63; i++) {
        // cerr << i << '\n';
        int cnt1 = (an + 1) / pow2[i] - (an + 1) / pow2[i + 1];
        // cerr << i << ' ' << cnt1 << ' ' << cnt[i] <<  '\n';
        int beg = pow2[i];
        int end = ((cnt1 - 1) * pow2[i + 1]) + pow2[i];
        ans += (i + 1) * ((beg + end) * cnt1 / 2);
        pre += cnt1 * (i + 1);
    }
    // cout << "?" << ans << '\n';
    ans += (n - pre) * (an + 1);
    print(ans % mod);
    putchar('\n');
}

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