import sys
input = sys.stdin.readline

mod=998244353


# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

X=[0]*14

A=[1,-1,2,-2,4,-4,-8,1,-1,2,-2,4,-4,-8]

S=[[0]*14 for i in range(14)]

for i in range(14):
    a=A[i]

    for b in [1,2,-1,-2]:
        to=a*b

        if to==8:
            c=7
            S[i][c]=1
        else:
            if i<7:
                for j in range(7):
                    if A[j]==to:
                        c=j
            else:
                for j in range(7,14):
                    if A[j]==to:
                        c=j

            S[i][c]=1

        
POWA=[S]

# 漸化式を行列累乗で求める（ダブリング）

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],14,14,14)) # ベキを求めて


mod=998244353

T=int(input())

for tests in range(T):
    n=int(input())

    X=[0]*14
    X[0]=1
    X=[X]

    while n:
        X=prod(X,POWA[n.bit_length()-1],1,14,14) # n乗の場合
        n-=1<<(n.bit_length()-1)

    #print(X)
    print(X[0][7])