MOD=998244353

n=int(input())

prime=[True]*(n+1)
prime[0]=False
prime[1]=False

emax=0
for i in range(2,n+1):
    if prime[i]:
        k=i
        e=0
        while n>=k:
            e+=n//k
            k*=i
        if i==2:
            emax=e
            prod=[1]*(emax+1)
        for j in range(1,e+1):
            prod[j]*=e//j+1
            prod[j]%=MOD
        j=2
        while i*j<=n:
            prime[i*j]=False
            j+=1
ans=MOD-emax
for i in range(1,emax+1):
    ans+=prod[i]
    ans%=MOD
print(ans)