import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from math import isqrt

def floor_sum(n, m, a, b):
    ans = 0
    if a < 0:
        ans += n*(n-1)*(a//m)//2
        a %= m
    if b < 0:
        ans += n*(b//m)
        b %= m
    while True:
        if a >= m:
            ans += n * (n - 1) * (a // m) // 2
            a %= m
        if b >= m:
            ans += n * (b // m)
            b %= m
        y_max = a * n + b
        if y_max < m: break
        n, b, m, a, = y_max // m, y_max % m, a, m
    return ans

n=II()
ans=0

root=isqrt(n)
s=n*(n+1)//2
for d in range(1,root+1):
    t=s
    s=floor_sum(n+1,d+1,1,0)
    ans+=d*(t-s)
    ans%=md
    print(d,s,t,ans)
for d in range(1, n//root):
    q, r = divmod(m, d)
    ans += (root+q)*(q-root-1)//2*d+r*q
    ans %= md
print(ans)