MOD = 998244353
N = 2*10**5

fact = [1]*(N+1)
rfact = [1]*(N+1)
for i in range(1, N+1):
  fact[i] = fact[i-1]*i % MOD
rfact[N] = pow(fact[N], MOD-2, MOD)
for i in range(N, 0, -1):
  rfact[i-1] = rfact[i] * i % MOD

# nPk (mod MOD) を求める
def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める
def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % MOD

ans = 0
N = int(input())
for m in range(0,N+1,2):
  ans += pow(2,abs(N-2*m),MOD)*2*comb(N,m)
  ans %= MOD
print(ans)