mod = 998244353

n = int(input())

fact = [1]
for i in range(n):
    fact.append(fact[i] * (i + 1) % mod)
inv = [0] * (n + 1)
inv[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    inv[i] = inv[i + 1] * (i + 1) % mod

def ncr(n, r):
    return fact[n] * inv[r] * inv[n - r] % mod

ans = 0
for i in range(0, n + 1, 2):
    ans += ncr(n, i) * pow(2, abs(n - 2 * i), mod)
ans *= 2
print(ans % mod)