import sys input = sys.stdin.readline N = int(input()) mod = 998244353 class sieve: def __init__(self, n): self.n = n self.sv = [1] * (n + 1) self.sv[0] = 0 self.sv[1] = 0 for i in range(2, n + 1): if self.sv[i]: for j in range(i * 2, n + 1, i): self.sv[j] = 0 def isprime(self, x): if x > self.n: return False return self.sv[x] == 1 def factorize(self, x): res = [] for i in range(2, int(x ** 0.5) + 1): if self.sv[i]: while x % i == 0: x //= i res.append(i) if x != 1: res.append(x) return res def modlcm(self, a, mod): res = [0] * (self.n + 1) ex = set() for i in range(len(a)): f = self.factorize(a[i]) for j in f: if j > self.n: ex.add(j) continue res[j] = max(f.count(j), res[j]) rres = 1 for i in range(self.n + 1): if res[i] != 0: rres *= pow(i, res[i], mod) rres %= mod for i in ex: rres *= i rres %= mod return rres sv = sieve(N) a = [x * (N - x) for x in range(1, N // 2 + 1)] print(sv.modlcm(a, mod))