n = int(input())

import math
g = n-1
a = n-1
for i in range(2,n):
    g = math.gcd(g, i*(n-i))

def lcm(a,b):
    return a*b // math.gcd(a,b)


mod = 998244353
flg = False
for i in range(2,n):
    a = lcm(a, i*(n-i))
    
print(a%mod)