import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
md = 998244353
# md = 10**9+7

n=II()

isprime=[True]*(n+1)
isprime[1]=False
pp=[]
for a in range(2,n+1):
    if a*a>n:break
    if not isprime[a]:continue
    for b in range(a*a,n+1,a):
        isprime[b]=False
for a in range(2,n+1):
    if isprime[a]:
        pp.append(a)
# print(pp)

m=len(pp)
ee=[1]*m
for i,p in enumerate(pp):
    s=1
    cnt=0
    while s<=n:
        s*=p
        cnt+=1
    if cnt==2:break
    ee[i]=cnt-1
# print(ee)

ans=1
for p,e in zip(pp[:-1],ee[:-1]):
    ans*=pow(p,e,md)
    ans%=md

print(ans)