import sys
#sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
sys.set_int_max_str_digits(0)
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd, lcm, factorial, perm, comb
from itertools import product, permutations, combinations
from functools import lru_cache #@lru_cache(maxsize=128)
#重複あり：list(product(list('123'),repeat = 2)),重複なし：list(permutations(list('123')))
MOD = 998244353

ans = [0]*(2*10**5+2)

tp1 = [1,1]
tp2 = [1,3]
ans[0] = 4
ans[1] = -4

for i in range(2*10**5):
    a = (tp1[0] + tp1[1])%MOD
    b = (tp2[0] + tp2[1])%MOD
    ans[i+2] = pow(a,2) * 5 - pow(b,2)
    tp1[0] = tp1[1]
    tp2[0] = tp2[1]
    tp1[1] = a
    tp2[1] = b

n = int(input())
for _ in range(n):
    print(ans[int(input())-1] % MOD)