mod = 998244353
N = int(input())
if N % 2 == 1:
    print(0)
    exit()

n = N // 2
ans = [0] * (n + 1)

catalan = [1, 1]
for i in range(2, n + 1):  # カタラン数を前計算
    catalan.append(catalan[-1] * 2 * (2 * i - 1) * pow(i + 1, -1, mod) % mod)

for i in range(2, n + 1):
    for j in range(1, i + 1):  # 左端の ( がどこで閉じるかで場合分け
        ans[i] += catalan[j - 1] * catalan[i - j] * (j - 1) % mod  # 左のカッコの寄与
        ans[i] += ans[j - 1] * catalan[i - j] % mod  # 左のカッコ内の寄与
        ans[i] += catalan[j - 1] * ans[i - j] % mod  # 右側の寄与
        ans[i] %= mod

print(ans[n])