#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 105;
const int mod = 1e9 + 7;

void add(int &x, int y) {
	x = (x + y) % mod;
}


int a[N] = {0};

void fnd() {
	int n;
	cin >> n;
	a[1] = 1, a[2] = 1;
	for (int i = 3; i <= n; i++)
		a[i] = a[i - a[i - 1]] + a[i - 1 - a[i - 2]];
	int l = 2, r;
	while (l <= n) {
		r = l;
		int cnt = 0;
		while (r <= n && a[r] == a[l])
			cnt++, r++;
		printf("(%d, %d): %d cnt = %d\n", l - 1, r - 2, a[l], cnt);
		l = r;
	}
} 

int pw[100] = {0};
int pws[100] = {0};
//?? lowbit ?? 
int res[100] = {0};
long long cnt[100] = {0};

int cal(int k) {
	//?? 1 ~ 2^k - 1 ? i log(lowbit(i)) 
	int ans = 0;
	for (int j = 1; j <= k; j++) {
		int sum = 1ll * pws[k - j] * pw[j] % mod;
		add(sum, 1ll * pw[j - 1] * pw[k - j] % mod);
		add(ans, 1ll * j * sum % mod);
		cnt[k] += j * (1ll << (k - j));
	//	if (k == 2)
	//		cout << j << " " << sum << endl;
	}
	return ans;
}

int f(long long n, int k) {
	if (n == 0ll)
		return 0;
//	cout << "At " << n << " " << k << " " << endl;	
	if (k == 1)
		return 1;
	if (n <= cnt[k - 1])
		return f(n, k - 1);
	if (n - cnt[k - 1] <= k)
		return (res[k - 1] + (n - cnt[k - 1]) * pw[k - 1] % mod) % mod;
	int ans = 0;
	add(ans, res[k - 1]);
	add(ans, 1ll * k * pw[k - 1] % mod);
	
//	cout << k << " : " << "ans: " << ans << endl;
		
	n -= cnt[k - 1];
	n -= k;
	add(ans, n % mod * pw[k - 1] % mod);
	add(ans, f(n, k - 1));
	
	return ans;
}

void slv() {
	long long n;
	cin >> n;
	n--;
	cout << (f(n, 60) + 1) % mod << endl;
}

int main() {
//	fnd();
	pw[0] = 1;
	for (int i = 1; i <= 60; i++)
		pw[i] = 2ll * pw[i - 1] % mod;
	for (int i = 1; i <= 60; i++) 
		pws[i] = 1ll * (pw[i] - 1) * pw[i - 1] % mod;
	for (int i = 0; i <= 60; i++) {
		res[i] = cal(i);
	//	if (i <= 5)
	//		cout << i << " " << cnt[i] << endl;
	/*	if (i < 5) {
			int ans = 0;
			for (int j = 1; j < (1 << i); j++) {
				int k = 0;
				while (!(j >> k & 1))
					k++;
				ans += (k + 1) * j;
			}
//			cout << "Chk " << ans << endl; 
		}*/
	}
//	return 0;
	int T;
	scanf("%d", &T);
	while (T--)
		slv();
	return 0;
}