import sys, collections, bisect, itertools, math

sys.setrecursionlimit(10 ** 6)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
nsa = lambda: list(map(str, stdin.readline().split()))
ntp = lambda: tuple(map(int, stdin.readline().split()))
mod = 998244353
inf = 10 ** 18

Yes = lambda: print('Yes')
No = lambda: print('No')
yes = lambda: print('yes')
no = lambda: print('no')

k = 100
DP = [0] * (k + 1)
DP[0] = 1
for i in range(k):
    for j in range(1, k - i + 1):
        DP[i + j] += DP[i] * 2
        DP[i + j] %= mod


for _ in range(ni()):
    n = ni()
    print(DP[n])