import math

MOD = 998244353

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

LCM = [0] + [math.lcm(*range(1, i + 1)) for i in range(1, LIMIT + 2)]
inv_2 = pow(2, MOD - 2, MOD)


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

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

    answer = 0

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

    print(answer)


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