#include <iostream>
using namespace std;
const int mod = 1000000007;
int binpow(int a, long long b) {
	int ret = 1;
	while (b) {
		if (b & 1) ret = 1LL * ret * a % mod;
		a = 1LL * a * a % mod;
		b >>= 1;
	}
	return ret;
}
int Q, N, fact[100009], dp[100009];
int main() {
	fact[0] = 1;
	for (int i = 1; i <= 100000; i++) fact[i] = 1LL * fact[i - 1] * i % mod;
	for (int i = 1; i <= 100000; i++) dp[i] = (1LL * i * dp[i - 1] + fact[i - 1]) % mod;
	for (int i = 0; i <= 100000; i++) {
		dp[i] = (dp[i] - fact[i] + mod) % mod;
		dp[i] = 1LL * dp[i] * i % mod;
	}
	cin >> Q; int R = Q;
	while (Q--) {
		cin >> N;
		cout << 1LL * N * N << endl;
		cout << 1LL * N * N * N + 1LL * (N - 1) * N << endl;
		cout << R << endl;
		cout << 4LL * N * N + 17 << endl;
		cout << binpow(N, 1LL * N * N * N) << endl;
		cout << N << endl;
		cout << dp[N] << endl;
		if (Q != 0) cout << endl;
	}
	return 0;
}