#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

using mint = modint998244353;

const int M = 200000;

int main(){
	int t;
	cin >> t;
	vector<mint> r(M);
	vector<mint> e(M);
	r[0] = 1; r[1] = 1;
	e[0] = 1; e[1] = 3;
	auto f = [&](vector<mint>& a){
		for(int x = 2; x < M; x++){
			a[x] = a[x - 1] + a[x - 2];
		}
	};
	f(r);
	f(e);
	rep(i, t){
		int n;
		cin >> n;
		n--;
		cout << 5 * r[n] * r[n] - e[n] * e[n] << "\n";
	}
	return 0;
}