from collections import defaultdict
N = int(input())

lpf = [-1] * (N + 1)
prime = []
for i in range(2, N + 1):
	if lpf[i] == -1:
		lpf[i] = i
		prime.append(i)
	for p in prime:
		if p * i > N or p > lpf[i]:
			break
		lpf[p * i] = p

cnt = []
for p in prime:
	k = p
	c = 0
	while k <= N:
		c += N // k
		k *= p
	cnt.append(c)

mod = 998244353

m = cnt[0]

ac = [1] * (m + 2)

# 後ろから累積積

for i in cnt:
	for j in range(1, i + 1):
		if i // j != i // (j + 1):
			ac[j] *= (i // j + 1) * pow(i // (j + 1) + 1, mod - 2, mod) % mod
			ac[j] %= mod

for i in range(m + 1, 0, -1):
	ac[i - 1] *= ac[i]
	ac[i - 1] %= mod

ans = 0

for i in range(1, m + 1):
	ans += i * (ac[i] - ac[i + 1])
	ans %= mod

print(ans)