from math import gcd
MOD = 998244353
n = int(input())
prime = [True for _ in range(n+1)]
for i in range(2, n+1):
	if not prime[i]:
		continue
	for j in range(i+i, n+1, i):
		prime[j] = False
#print(prime)
for i in range(n, 1, -1):
	if prime[i]:
		key = i
		break
#print(key)
ans = 1
for i in range(1, n+1):
	if i == key:
		continue
	ans = (ans * i * pow(gcd(ans, i), MOD-2, MOD)) % MOD
print(ans)