from math import lcm
mod = 998244353

inf = 10 ** 18 + 10
lc = [1]
for i in range(1, 100):
    lc.append(lcm(i, lc[-1]))
    if lc[-1] > inf:
        break

ma = len(lc)

def solve():
    n = int(input())
    ans = 0
    for x in range(1, ma):
        d = lc[x]
        p, q = divmod(n, d)
        p %= mod
        q %= mod
        tmp = (p * (p - 1) // 2) * d
        tmp += p * (q + 1)
        ans += tmp * (d // x) % mod
        ans %= mod
    print(ans)

t = int(input())
for i in range(t):
    solve()