#include<bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long
const int N = 1e6 + 6;
const int mod = 1e9 + 7;
ll fac[N], inv[N];
ll C(int n, int m) {
	if (n < m) return 0;
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
ll ksm(ll a, int b) {
	ll ans = 1;
	for (; b; b >>= 1, a = a * a % mod) {
		if (b & 1) ans = ans * a % mod;
	}
	return ans;
}

void solve() {
	int n;
	cin >> n;
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		int m = n - i;
		if (m & 1) continue;
		m /= 2;
		ans = (ans + C(n, i) * ((C(2 * m, m) - C(2 * m, m - 1) % mod + mod) % mod) % mod) % mod;
	}
	ans = (ans + 1) % mod;
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	fac[0] = 1;
	for (int i = 1; i <= 1000000; i++) fac[i] = fac[i - 1] * i % mod;
	inv[1000000] = ksm(fac[1000000], mod - 2) % mod;
	for (int i = 1000000; i >= 1; i--) inv[i - 1] = inv[i] * i % mod;
	int t;
	cin >> t;
	while (t--) solve();
	QwQ330AwA;
}