import sys
input = sys.stdin.readline

from collections import Counter

# エラトステネスの篩を用いた素因数分解・約数列挙
MAX=3*10**6+10 # 使いたい最大値を指定

# Sieve[i]で、iの最も小さい約数を返す。
Sieve=[i for i in range(MAX)]

for i in range(2,MAX):
    if Sieve[i]!=i:
        continue
    
    for j in range(i,MAX,i):
        if Sieve[j]==j:
            Sieve[j]=i

# 素因数分解
def fact(x):
    D=dict()
    while x!=1:
        k=Sieve[x]
        if k in D:
            D[k]+=1
        else:
            D[k]=1
        x//=k
    return D

# 約数列挙
def faclist(x):
    LIST=[1]
    while x!=1:
        k=Sieve[x]
        count=0
        while x%k==0:
            count+=1
            x//=k

        LIST2=[]
        for l in LIST:
            for i in range(1,count+1):
                LIST2.append(l*k**i)
        LIST+=LIST2

    return LIST

N=int(input())

mod=998244353

D=Counter()

for i in range(2,N+1):
    F=fact(i)

    for f in F:
        D[f]+=F[f]

LIST=list(D.values())

MAX=max(LIST)

ANS=0

for i in range(1,MAX+1):
    X=[]
    sc=1
    for l in LIST:
        if l//i>0:
            X.append(l)
            sc=sc*(l//i+1)%mod

    #print(LIST,X,sc)

    ANS+=sc-1
    LIST=X

print(ANS%mod)