mod = 998244353
fact = [1] * 101
inv = [1] * 101
finv = [1] * 101
for i in range(2, 101):
    fact[i] = fact[i - 1] * i % mod
    inv[i] = mod - inv[mod % i] * (mod // i) % mod
    finv[i] = finv[i - 1] * inv[i] % mod

def comb(x, y):
    return fact[x] * finv[y] * finv[x - y] % mod

t = int(input())
for _ in range(t):
    n = int(input())
    ans = 0
    for i in range(n):
        ans += comb(n - 1, i) * pow(2, i + 1, mod) % mod
        ans %= mod
    print(ans)