from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from decimal import Decimal,ROUND_HALF_UP
#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
from functools import lru_cache, reduce
#@lru_cache(maxsize=None)
from operator import add,sub,mul,xor,and_,or_,itemgetter
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353

#DecimalならPython
#再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!

def sieve(n):
    is_prime = [True for _ in range(n+1)]
    is_prime[0] = False
    is_prime[1] = False

    for i in range(2, n+1):
        if is_prime[i]:
            j = 2 * i
            while j <= n:
                is_prime[j] = False
                j += i
    table = [ i for i in range(1, n+1) if is_prime[i]]
    return is_prime, table

class Eratosthenes:
    def __init__(self, n):
        self.isprime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isprime[1] = False
        self.minfactor[1] = 1
        for p in range(2, n + 1):
            if self.isprime[p]:
                self.minfactor[p] = p
                q = p
                while q <= n:
                    self.isprime[q] = False
                    q += p
                    
                    if q > n:
                        break
                    
                    if self.minfactor[q] == -1:
                        self.minfactor[q] = p
    
    def factorize(self, n):
        factors = []
        while n > 1:
            p = self.minfactor[n]
            exp = 0
            while self.minfactor[n] == p:
                n //= p
                exp += 1
            factors.append((p, exp))
        return factors
    
    def divisors(self, n):
        res = [1]
        pf = self.factorize(n)
        for p in pf:
            s = len(res)
            for i in range(s):
                v = 1
                for j in range(p[1]):
                    v *= p[0]
                    res.append(res[i] * v)
        return res


'''
エラトステネスっぽくやるのが思いつくけど
ダメだな
こんなん愚直にやればよくね
gcdだけ取り除くべき
最大の素数はかけないほうが良い
逆元がない可能性があるじゃん
困った
逆元持つまで素因数分解するみたいなのもありか?
いや、modの話だわ
素数じゃないといけないのは
ansがmodとってるから、gcdが機能してない
エラトステネスで、先に割ってあげる
後ろからかけていったらどう
それの約数分解をmemoにぶちこむ

N = 8のとき、6をかけるのではなく3をかけたほうがよい
'''

N = int(input())

prime,t = sieve(N+1)
er = Eratosthenes(N+1)
pr = -1
memo = [0]*(N+1)

ans = 1
for i in range(1,N+1):
    for p,e in er.factorize(i):
        if e-memo[p] <= 0:
            continue
        ans *= pow(p,e-memo[p],mod2)
        ans %= mod2
        memo[p] += e-memo[p]
    
    if prime[i]:
        pr = i

ans *= pow(pr,mod2-2,mod2)
ans %= mod2

print(ans)