mod = 998244353
n = int(input())
f = [1] * (n + 1)
for i in range(n):
    f[i+1] = f[i] * (i + 1)     % mod
fi = [pow(f[n], mod - 2, mod)] * (n + 1)
for i in range(n, 0, -1):
    fi[i-1] = fi[i] * i % mod
ans = 0
for i in range(0, n + 1, 2):
    ans = (ans + 2 * f[n] * fi[n-i] * fi[i] * pow(2, abs(-n + 2 * i), mod)) % mod
print(ans)