from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
setrecursionlimit(20000000) # これこどふぉだと無理
#set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
inf = 10**18


n = ii() 

if n % 2:
    print(0) 
    exit() 

dp1 = [0]*(n+1) 
dp2 = [0]*(n+1) # ここにスコアを加算
dp1[0] = 1 

for _ in range(n):
    ndp1 = [0]*(n+1) 
    ndp2 = [0]*(n+1) 

    for j in range(n):
        # ) を加える場合
        ndp1[j+1] += dp1[j] 
        ndp2[j+1] += dp2[j] 
        if j:
            ndp1[j-1] += dp1[j] 
            ndp2[j-1] += (dp2[j] + (j-1)*dp1[j]) % mod 
    
    for j in range(n+1):
        ndp1[j] %= mod 
        ndp2[j] %= mod 

    dp1 = ndp1 
    dp2 = ndp2 

print(ndp2[0])