def cal(a):
    X = []
    for a0 in range(a+1):
        for a1 in range(a-a0+1):
            X.append((a0, a1, a-a0-a1))
    rep = 0
    for xi in X:
        for xj in X:
            for i in range(3):
                if xi[i]+xj[i] > a:
                    break
            else:
                rep += 1
    return rep

mod = 998244353
def main():
    n = int(input())
    a = 2
    ans = 1
    while a*a <= n:
        c = 0
        while not n % a:
            c += 1
            n //= a
        ans = ans * A[c] % mod
        a += 1
    if n-1:
        ans = ans * A[1] % mod
    return ans
A = [cal(a) for a in range(21)]
for _ in range(int(input())):
    print(main())