#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define int long long
using namespace std;
const int mod = 1000000007;
int jie[1000006], inv[1000006], t, n, ans;
inline int ksm(int p, int q = mod - 2) {
	int base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
inline int C(int p, int q) {
	if (p < 0 || q < 0 || p < q) return 0;
	return jie[p] * inv[q] % mod * inv[p - q] % mod;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	jie[0] = inv[0] = 1;
	for (int i = 1; i <= 1000000; i++) {
		jie[i] = jie[i - 1] * i % mod;
	}
	inv[1000000] = ksm(jie[1000000], mod - 2);
	for (int i = 1000000 - 1; i >= 0; i--) {
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
	cin >> t;
	while (t--) {
		cin >> n;
		ans = 0;
		for (int i = 0; i * 2 <= n; i++) {
			ans += C(n, 2 * i) * C(2 * i, i) % mod * ksm(i + 1) % mod;
			ans %= mod;
		}
		cout << ans << "\n";
	}
}