from collections import Counter

NN = 10**6 + 100
spf = list(range(NN))  

for i in range(2, int(NN**0.5)+1):
    if spf[i] == i:
        for j in range(i*i, NN, i):
            if spf[j] == j:
                spf[j] = i

def fast_factorize(x):
    res = []
    while x > 1:
        res.append(spf[x])
        x //= spf[x]
    return res


T = int(input())
mod = 998244353
ans = []
calc = [0]*(23)
for i in range(1, 23):
    res = 0
    for p11 in range(i+1):
        for p13 in range(i+1):
            for p31 in range(i+1):
                for p33 in range(i+1):
                    p12 = i-p11-p13
                    p21 = i-p11-p31
                    p23 = i-p13-p33
                    p32 = i-p31-p33
                    p22 = i-p21-p23
                    if 0 <= p12 and 0 <= p21 and 0 <= p23 and 0 <= p32 and 0 <= p22:
                        res += 1
    calc[i] = res

for _ in range(T):
    K = int(input())
    C = Counter(fast_factorize(K))
    res = 1
    for v in C.values():
        res *= calc[v]
        res %= mod
    ans.append(res)

for i in ans:
    print(i)