n = 101
fac_arr = [1] * (n+1)
r_s_fac_arr = [1] * (n+1)
mod = 998244353
for i in range(1,n+1):
    fac_arr[i] = (fac_arr[i-1] % mod) * i % mod
    r_s_fac_arr[i] = (r_s_fac_arr[i-1] % mod) * pow(i,mod-2,mod) % mod 
def nCk_Mod(n,k):
    return fac_arr[n]  % mod *  r_s_fac_arr[k] % mod * r_s_fac_arr[n-k] % mod


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