#include<iostream>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstdio>
#include<set>
#include<vector>
#include<map>
#include<stack>
using namespace std;
const int N = 110;
const int inf = 0x3f3f3f3f;
typedef long long ll;
#define reg register
const int mod = 1e9 + 7;
inline ll gcd(reg ll a, reg ll b) {
	return b == 0 ? a : gcd(b, a % b);
}
inline ll lcm(reg ll a, reg ll b) {
	return a / gcd(a, b) * b;
}
signed main()
{
	ios::sync_with_stdio(false);
	//freopen("文本.txt", "r", stdin);
	ll T, n;
	cin >> T;
	while (T--) {
		cin >> n;
		reg ll res = 0, k = 1;
		for (reg ll i = 1; k <= n; i++) {
			k = lcm(k, i);
			if (n < k) break;
			res += n / k;
		}
		cout << (res + n) % mod << endl;
	}
	return 0;
}