#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	vector<mint>a(1000006);
	vector<mint>pw2(1000006 * 3, 1);
	rep2(i, 1, pw2.size())pw2[i] = pw2[i - 1] * 2;
	a[0] = 0, a[1] = 1, a[2] = 1;
	rep2(i, 3, 1000006) {
		a[i] = a[i - 1] * pw2[2 * i - 3] - pw2[3 * i - 7] - pw2[2 * i - 5] + pw2[i - 3];
	}
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		cout << a[n].val() << endl;
	}
	return 0;
}