N = int(input())
mod = 998244353
fac = [0]*(N+1)
inv = [0]*(N+1)
fac[0], inv[0] = 1, 1
for i in range(1, N+1):
    fac[i] = fac[i-1]*i
    fac[i] %= mod
    inv[i] = inv[i-1]*pow(i, mod-2, mod)
    inv[i] %= mod
res = 0
for i in range(0, N+1, 2):
    res += 2*fac[N]*inv[i]*inv[N-i]*pow(2, abs(N-2*i), mod)
    res %= mod
print(res)