N = int(input())

def cmb(n, r, p):
  if (r < 0) or (n < r):
    return 0
  r = min(r, n - r)
  return fac[n]*finv[r]*finv[n-r]%p

MOD = 998244353

fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
  fac[i] = fac[i-1]*i%MOD
  inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
  finv[i] = finv[i-1]*inv[i]%MOD
  

ans = 0
for i in range(N+1):
  if i%2 == 1:
    continue
  score = pow(2,abs(N-2*i),MOD)
  kosu = cmb(N,i,MOD)*2
  #print(score,kosu)
  ans = (ans+score*kosu)%MOD
print(ans)