import math

def is_prime(x):
    for i in range(x+5):
        j=i+2
        if(j*j>x):
            break
        if(x%j==0):
            return 0
    return 1

flag=1
n=int(input())
res=1
for i in range(n):
    j=n-i
    if(flag and is_prime(j)):
        flag=0
    else:
        res=res*j//math.gcd(res,j)
res%=998244353
print(res)
#print(is_prime(n))