import math

MOD = 998244353

# Index * A Problem の答えの上界
LIMIT = 40

LCM = [0] + [math.lcm(*range(1, i + 1)) for i in range(1, LIMIT + 1)]
LCM_MOD = [L % MOD for L in LCM]
inv = [0] + [pow(i, -1, MOD) for i in range(1, LIMIT + 1)]


def solve():
    N = int(input())

    def count(ans):
        loop = N // LCM[ans] % MOD
        res = (LCM_MOD[ans] * inv[ans]  % MOD) * ((N + 1) * loop % MOD - loop * (loop + 1) % MOD * inv[2] % MOD * LCM_MOD[ans]) % MOD
        return res

    answer = 0

    for i in range(1, LIMIT + 1):
        answer += count(i)
        answer %= MOD

    print(answer)


if __name__ == "__main__":
    T = int(input())
    for _ in range(T):
        solve()