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

l=[1,1]
[l.append(l[i] + l[i-1]) for i in range(1,2*10**5)]
ll=[1,3]
[ll.append(ll[i] + ll[i-1]) for i in range(1,2*10**5)]

for i in range(1,10**5):
    ll.append(ll[i] + ll[i-1])
for _ in range(int(input())):
    n = int(input())
    print((pow(l[n-1],2) * 5 - pow(ll[n-1],2))%MOD)