import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
#
#alist = []
#s = input()

input = sys.stdin.readline
t = int(input())

for i in range(t):
    n = int(input())
    mod = 998244353
    p = 1 - pow(2,mod-2,mod) * pow((3*pow(4,mod-2,mod)),n-2,mod)
    q = 1 + (n-1) * p
    q *= pow(2,n*(n-1)//2,mod)
    q %= mod
    print(q)