from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import randint
# from itertools import permutations 

def mat_mul(a,b,mod=998244353):
    assert len(a[0]) == len(b)
    ret = [[0]*len(b[0]) for _ in range(len(a))] 
    for i,reti in enumerate(ret):
        for k,a_ik in enumerate(a[i]):
            for j,b_kj in enumerate(b[k]):
                reti[j] = (reti[j] + a_ik*b_kj) % mod 

    return ret 


def mat_pow(a,k):
    ret = [[int(i==j) for j in range(len(a))] for i in range(len(a))]
    tmp = a 
    for i in range(k.bit_length()):
        if (k >> i) & 1:
            ret = mat_mul(ret,tmp) 
        tmp = mat_mul(tmp,tmp) 

    return ret 

a = [[1,1,0,0,1,1,1],
     [1,1,0,0,0,0,0],
     [1,1,1,1,0,0,0],
     [1,1,1,1,0,0,0],
     [0,0,1,1,1,1,0],
     [0,0,1,1,1,1,0],
     [0,0,0,0,1,1,1]
     ]


t = ii() 
for _ in range(t):
    n = ii()
    aa = mat_pow(a,n)
    print((aa[0][0]-pow(2,n-1,mod))%mod)