#include int main () { int q = 0; int n = 0; int res = 0; long long r[200000] = {}; long long e[200000] = {}; long long mod_num = 998244353LL; r[0] = 1LL; r[1] = 1LL; e[0] = 1LL; e[1] = 3LL; for (int i = 2; i < 200000; i++) { r[i] = (r[i-1]+r[i-2])%mod_num; e[i] = (e[i-1]+e[i-2])%mod_num; } res = scanf("%d", &q); while (q > 0) { long long ans = 0LL; res = scanf("%d", &n); ans = (r[n-1]*r[n-1])%mod_num; ans *= 5LL; ans += mod_num-(e[n-1]*e[n-1])%mod_num; printf("%lld\n", ans%mod_num); q--; } return 0; }