n=int(input())
mod=998244353
P=[i for i in range(n+1)]
for i in range(2,n+1):
 if P[i]!=1:
  for j in range(i+i,n+1,i):
   P[j]//=P[i]
maxp=max(P)
res=pow(maxp,mod-2,mod)
for i in range(1,n+1):
 res=res*P[i]%mod
print(res)