#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAX_N = 1000000 + 5;
const int P = 1000000000 + 7;

bool check(ll mid, ll n) {
    ll cnt = 0;
    while (mid) {
        cnt += mid;
        if (cnt > n) return false;
        mid >>= 1;
    }
    return true;
}

int main() {
    int T;
    scanf("%d", &T);
    while (T --) {
        ll n, l, r, cnt = 0;
        scanf("%lld", &n);
        if (n == 1) {
            printf("1\n");
            continue;
        }
        n --;
        l = 1; r = n;
        while (l < r) {
            ll mid = l + r + 1 >> 1;
            if (check(mid, n)) l = mid;
            else r = mid - 1;
        }
        int ans = 1, pow2 = 1;
        while (l) {
            cnt += l;
            int tmp = l % P;
            ans = (ans + (tmp + 1ll) * tmp / 2 % P * pow2) % P;
            l >>= 1; pow2 = (pow2 << 1) % P;
        }
        ans = (ans + (n - cnt) % P * ((r + 1) % P)) % P;
        printf("%d\n", ans);
    }
    return 0;
}