#include using namespace std; const long long mod = 998244353; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); vector R = {1,1}; vector E = {1,3}; for (int i = 0; i < 2e5; i++){ R.push_back((R[1+i] + R[i]) % mod); E.push_back((E[1+i] + E[i]) % mod); } int q; cin >> q; for (int i = 0; i < q; i++){ int n; cin >> n; n--; long long ans = (5 * R[n]*R[n] - E[n]*E[n])%mod; if (ans < 0) ans += mod; cout << ans << endl; } return 0; }