N = int(input())
MOD = 998244353
def inv(x):
    return pow(x, MOD-2, MOD)
def solve(x):
    num = N - x + 1
    p = num // x
    a = num % x
    res = (1 + p) * p * inv(2) * x
    res %= MOD
    res += (p+1) * a
    res %= MOD
    return res
    

ans = 0
for i in range(1, N+1):
    ans += solve(i)
    # print(i, solve(i))
    ans %= MOD
print(ans)