#include <bits/stdc++.h>
using namespace std;
#define int long long
const int p = 1e9 + 7;
const int inv2 = (p + 1) / 2;
inline int CountCnt(int an) {
    // n >= 1
    int ans = 1;
    for (int num = 1, base = 1; base <= an; base <<= 1, num += 1) {
        int delta = base << 1;
        int cnt = (an - base) / delta + 1;
        ans += num * cnt;
    } 
    return ans;
}
inline int CountSm(int an) {
    int ans = 2;
    for (int num = 1, base = 1; base <= an; base <<= 1, num += 1) {
        int delta = base << 1;
        int cnt = (an - base) / delta + 1;
        ans += (num % p) * ((base + base + (cnt - 1) * delta) % p) % p * (cnt % p) % p;
    } 
    return ans % p * inv2 % p;
}
signed main() {
    int Case;
    scanf("%lld", &Case);
    while (Case--) {
        int n;
        scanf("%lld", &n);
        if (n == 1) { puts("1"); continue; }
        int an;
        for (int l = n / 2, r = n; l <= r; ) {
            int mid = (l + r) >> 1;
            int cnt = CountCnt(mid);
            if (cnt >= n) an = mid, r = mid - 1; else l = mid + 1; 

        }
        int cnt = CountCnt(an);
        int ans = (CountSm(an) - an * (cnt - n)) % p;
        if (ans < 0) ans += p;
        printf("%lld\n", ans);
    }
}