"""

https://oeis.org/A006419

()(()) ; 1
(())() ; 1
(()()) ; 2
((())) ; 

"""

import sys

def solve(N):

    ans = 0

    for bit in range(2**N):
        if bit.bit_count()*2 != N:
            continue

        now = 0
        h = 0
        for i in range(N):
            if (2**i) & bit==0 and (2**(i+1))&bit>0:
                now += h

            if (2**i) & bit==0:
                h += 1
            else:
                h -= 1

            if h < 0:
                break
        else:
            ans += now

    return ans


mod = 998244353

#for i in range(20):
#    print (solve(i))

def modfac(n, MOD):
 
    f = 1
    factorials = [1]
    for m in range(1, n + 1):
        f *= m
        f %= MOD
        factorials.append(f)
    inv = pow(f, MOD - 2, MOD)
    invs = [1] * (n + 1)
    invs[n] = inv
    for m in range(n, 1, -1):
        inv *= m
        inv %= MOD
        invs[m - 1] = inv
    return factorials, invs


def modnCr(n,r): #上で求めたfacとinvsを引数に入れるべし(上の関数で与えたnが計算できる最大のnになる)

    return fac[n] * inv[n-r] * inv[r] % mod

fac,inv = modfac(2*10**6+10,mod)

TT = int(input())

for loop in range(TT):

    N = int(input())
    if N % 2 == 1:
        print (0)
        continue

    N //= 2
    N -= 1

    ans = pow(4,N,mod) - modnCr(2*N+1,N)
    print (ans % mod)