mod = 998244353

class Prime():
  def __init__(self,N):
    self.N = N
    self.Is_prime = [1 for i in range(N+1)]
    self.Is_prime[0] = self.Is_prime[1] = 0
    self.P = []
    #self.Fact = [[] for i in range(N+1)]   #################
    #self.Fact[1] = [(1,1)]  ################################
    for p in range(2,N + 1):
      if self.Is_prime[p] == 0:
        continue
      self.P.append(p)
      #self.Fact[p].append((p,1))  ##########################
      for d in range(2,N//p + 1):
        self.Is_prime[p*d] = 0
        q = 1
        r = p
        while (p*d) % (p*r) == 0:
          q += 1
          r *= p
        #self.Fact[p*d].append((p,q))  ######################
  
  def is_prime(self,p):
    return self.Is_prime[p]
  
  def primelist(self):
    return self.P
  
  def fact(self,n): #########のところを外して使う.
    return self.Fact[n]
  
N = int(input())
P = Prime(N)
Q = []
for p in range(2,N + 1):
  q = 0
  pp = p
  if P.is_prime(p):
    while pp <= N:
      q += N // pp
      pp *= p
    Q.append(q)

M = max(Q)
C = [0 for i in range(M + 1)]
for q in Q:
  C[q] += 1

X = [1 for i in range(M + 1)]
res = 0
for q in range(1,M + 1):
  if C[q]:
    for r in range(1,q + 1):
      c = pow((q // r) + 1,C[q],mod)
      X[r] = X[r] * c % mod
ans = -(M + 1)
ans += sum(X) % mod
ans %= mod
print(ans)