class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*2, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return sorted(ans)

N = int(input())

E = Eratosthenes(N)
D = dict()
for i in range(2, N+1):
    for n, c in E.factorize(i):
        if n in D:
            D[n] += c
        else:
            D[n] = c
D = sorted([(n, c) for n, c in D.items()], key=lambda x:x[1], reverse=True)

MOD = 998244353
ans = 0
for i in range(1, 1000000):
    cnt = 1
    for n, c in D:
        if c >= i:
            cnt *= c//i+1
            cnt %= MOD
        else:
            break
    cnt -= 1
    cnt %= MOD
    ans += cnt
    ans %= MOD

print(ans)