#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<mint>r(200005), e(200005);
	r[0] = 1, r[1] = 1;
	e[0] = 1, e[1] = 3;
	rep2(i, 2, 200005) {
		r[i] = r[i - 1] + r[i - 2];
		e[i] = e[i - 1] + e[i - 2];
	}
	int q; cin >> q;
	while (q--) {
		int n; cin >> n;
		n--;
		mint ans = 5 * r[n] * r[n] - e[n] * e[n];
		cout << ans.val() << endl;
	}
	return 0;
}